On the <i>Embed and Project</i> Algorithm for the Graph Bandwidth Problem
The graph bandwidth problem, where one looks for a labeling of graph vertices that gives the minimum difference between the labels over all edges, is a classical NP-hard problem that has drawn a lot of attention in recent decades. In this paper, we focus on the so-called <i>Embed and Project A...
Main Author: | Janez Povh |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-08-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/17/2030 |
Similar Items
-
Clustering Improves the Goemans–Williamson Approximation for the Max-Cut Problem
by: Angel E. Rodriguez-Fernandez, et al.
Published: (2020-08-01) -
EMBBED DAJARE WORD PLAY PROCESS IN “SHIROKUMA CAFÉ”
by: Talin Salisah, et al.
Published: (2020-06-01) -
Bandwidth Cost Minimization via User Association for Enterprise WLANs
by: Xili Wan, et al.
Published: (2018-11-01) -
Applications of Semidefinite Optimization in Stochastic Project Scheduling
by: Bertsimas, Dimitris J., et al.
Published: (2003) -
Short Review of EMB Systems Related to Safety Concepts
by: Simon Schrade, et al.
Published: (2022-07-01)