Pages that link to "Item:Q1978696"
From MaRDI portal
The following pages link to Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696):
Displaying 13 items.
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Flow metrics (Q596135) (← links)
- \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
- Interval degree and bandwidth of a graph (Q1406031) (← links)
- A branch and bound algorithm for the matrix bandwidth minimization (Q2462146) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- Convex Relaxations for Permutation Problems (Q3456867) (← links)
- An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)
- Retracting Graphs to Cycles (Q5091228) (← links)
- On semidefinite programming bounds for graph bandwidth (Q5299908) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313022) (← links)