Pages that link to "Item:Q4542524"
From MaRDI portal
The following pages link to Approximating the bandwidth via volume respecting embeddings (extended abstract) (Q4542524):
Displaying 15 items.
- Bandwidth and low dimensional embedding (Q388456) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- Selected papers in honor of Manuel Blum on the occasion of his 60th birthday. Selected papers from the international conference in Theoretical Computer Science, Hong Kong, April 20-24, 1998 (Q1572590) (← links)
- Approximating the bandwidth via volume respecting embeddings (Q1577009) (← links)
- Cubicity and bandwidth (Q1938886) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- Efficient algorithms for online decision problems (Q2568459) (← links)
- Improved bandwidth approximation for trees and chordal graphs (Q2746436) (← links)
- Bandwidth and Low Dimensional Embedding (Q3088081) (← links)
- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs (Q3655149) (← links)
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time (Q5458530) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
- On approximation intractability of the path-distance-width problem (Q5936467) (← links)
- On dominated \(\ell_1\) metrics (Q5939287) (← links)
- Bandwidth and topological bandwidth of graphs with few \(P_4\)'s (Q5954243) (← links)