Pages that link to "Item:Q5479359"
From MaRDI portal
The following pages link to Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479359):
Displayed 8 items.
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Hardness results for approximating the bandwidth (Q619902) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- Labeling schemes for weighted dynamic trees (Q2464140) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars (Q3465943) (← links)
- An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time (Q5458530) (← links)