On semidefinite programming bounds for graph bandwidth
From MaRDI portal
Recommendations
Cites work
- A Copositive Programming Approach to Graph Partitioning
- A spectral approach to bandwidth and separator problems in graphs
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Bandwidth of the complete \(k\)-ary tree
- Characterization of graphs with equal bandwidth and cyclic bandwidth
- Complexity Results for Bandwidth Minimization
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Improved bandwidth approximation for trees and chordal graphs
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
- Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- Optimal labelling of a product of two paths
- Optimal numberings and isoperimetric problems on graphs
- Relaxations of combinatorial problems via association schemes
- SDP relaxations for some combinatorial optimization problems
- Semidefinite programming relaxations for the quadratic assignment problem
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- The Bandwidth of Caterpillars with Hairs of Length 1 and 2
- The NP-completeness of the bandwidth minimization problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(9)- Lower bounds for the bandwidth problem
- scientific article; zbMATH DE number 2166873 (Why is no real title available?)
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
- On bounding the bandwidth of graphs with symmetry
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
- scientific article; zbMATH DE number 11990 (Why is no real title available?)
- Tabu search for the cyclic bandwidth problem
- A multi-start variable neighborhood tabu search algorithm for the cyclic bandwidth problem
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
This page was built for publication: On semidefinite programming bounds for graph bandwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5299908)
