Vertex Sparsification and Oblivious Reductions

DOI10.1137/100787337zbMath1285.68227OpenAlexW2169615079MaRDI QIDQ5408771

Ankur Moitra

Publication date: 11 April 2014

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/100787337

zbMATH Keywords

approximation algorithmmetric spacegraph partitioningroutingsparsification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Parameterized complexity dichotomy for \textsc{Steiner Multicut} ⋮ Unnamed Item