Lower bounds for the bandwidth problem
From MaRDI portal
Publication:2669517
DOI10.1016/j.cor.2021.105422OpenAlexW2936957901MaRDI QIDQ2669517
Franz Rendl, Christian Truden, Renata Sotirov
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.06715
Related Items
Strong SDP based bounds on the cutwidth of a graph, Partitioning through projections: strong SDP bounds for large graph partition problems
Uses Software
Cites Work
- Unnamed Item
- Tabu search for the cyclic bandwidth problem
- Branch and bound for the cutwidth minimization problem
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- The MIN-cut and vertex separator problem
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Optimal labelling of a product of two paths
- The NP-completeness of the bandwidth minimization problem
- Minimum range sequences of all k-subsets of a set
- Semidefinite programming relaxations for the quadratic assignment problem
- ADMM for the SDP relaxation of the QAP
- On the bandwidth of triangulated triangles
- Bandwidth of the complete \(k\)-ary tree
- Interlacing eigenvalues and graphs
- Semidefinite programming relaxations for the graph partitioning problem
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
- Multistart search for the cyclic cutwidth minimization problem
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- On the edge-bandwidth of graph products
- On Bounding the Bandwidth of Graphs with Symmetry
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- On Some Variants of the Bandwidth Minimization Problem
- On Solving the Quadratic Shortest Path Problem
- On the Probable Performance of Heuristics for Bandwidth Minimization
- The bandwidth problem for graphs and matrices—a survey
- Complexity Results for Bandwidth Minimization
- Laplace eigenvalues and bandwidth‐type invariants of graphs
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Index assignment for multichannel communication under failure
- A spectral approach to bandwidth and separator problems in graphs
- On semidefinite programming bounds for graph bandwidth
- A Copositive Programming Approach to Graph Partitioning
- Optimal numberings and isoperimetric problems on graphs
- A remark on a problem of Harary
- Optimal Assignments of Numbers to Vertices
