Vertex Sparsifiers: New Results from Old Techniques
From MaRDI portal
Publication:5901179
DOI10.1007/978-3-642-15369-3_12zbMath1302.90233arXiv1006.4586OpenAlexW2057931683MaRDI QIDQ5901179
Kunal Talwar, Matthias Englert, Harald Räcke, Robert Krauthgamer, Inbal Talgam-Cohen, Anupam Gupta
Publication date: 10 September 2010
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.4586
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (5)
Metric extension operators, vertex sparsifiers and Lipschitz extendability ⋮ Unnamed Item ⋮ A node-capacitated Okamura-Seymour theorem ⋮ Cutting Corners Cheaply, or How to Remove Steiner Points ⋮ Unnamed Item
This page was built for publication: Vertex Sparsifiers: New Results from Old Techniques
