Approximating the bandwidth via volume respecting embeddings (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Small distortion and volume preserving embeddings for planar and Euclidean metrics
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Random Projection: A New Approach to VLSI Layout
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Efficient algorithms for online decision problems
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Exact and approximate bandwidth
Theoretical Computer Science
Volume in general metric spaces
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Hardness results for approximating the bandwidth
Journal of Computer and System Sciences
Approximating the bandwidth of caterpillars
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
An exponential time 2-approximation algorithm for bandwidth
Theoretical Computer Science
| Hi-index | 0.00 |
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n√log log n) approximation for minimum bandwidth in conjunction with a semi-definite relaxation, (2) an O(log3 n) approximation in O(nlog n) time using a new constraint set, (3) a lower bound of θ(√log n) on the least possible volume distortion for Euclidean metrics, (4) a new embedding with O(√log n) distortion of point-to-subset distances.