On the <i>Embed and Project</i> Algorithm for the Graph Bandwidth Problem

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...

Full description

Bibliographic Details
Main Author: Janez Povh
Format: Article
Language:English
Published: MDPI AG 2021-08-01
Series:Mathematics
Subjects:
graph bandwidth problem
semidefinite programming
combinatorial optimization
embed and project algorithm
approximation algorithm
Online Access:https://www.mdpi.com/2227-7390/9/17/2030

Internet

https://www.mdpi.com/2227-7390/9/17/2030

Similar Items