Cuts, trees and l/sub 1/-embeddings of graphs
Authors:
- I. NewmanINI. Newman
- Y. RabinovichYRY. Rabinovich
- A. SinclairASA. Sinclair
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree ProblemJournal of Algorithms, 2000
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning TreesSIAM Journal on Computing, 2000
- On embedding trees into uniformly convex Banach spacesIsrael Journal of Mathematics, 1999
- An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation AlgorithmSIAM Journal on Computing, 1998
- The geometry of graphs and some of its algorithmic applicationsCombinatorica, 1995
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applicationsCombinatorica, 1995
- A Graph-Theoretic Game and Its Application to the k-Server ProblemSIAM Journal on Computing, 1995
- On lipschitz embedding of finite metric spaces in Hilbert spaceIsrael Journal of Mathematics, 1985
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- Multicommodity flows in planar graphsJournal of Combinatorial Theory, Series B, 1981