Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/b99805zbMath1105.68313OpenAlexW4301133941MaRDI QIDQ5313023

Éva Tardos, Zoya Svitkina

Publication date: 25 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99805

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (12)

Parameterized algorithms for min-max multiway cut and list digraph homomorphism ⋮ \(\ell_p\)-norm multiway cut ⋮ Unbalanced graph partitioning ⋮ A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem ⋮ Cut problems in graphs with a budget constraint ⋮ Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition ⋮ Submodular Cost Allocation Problem and Applications ⋮ Unbalanced graph cuts with minimum capacity ⋮ Fixed parameter approximation scheme for min-max \(k\)-cut ⋮ An approximation algorithm for vehicle routing with compatibility constraints ⋮ Posimodular function optimization ⋮ Fixed parameter approximation scheme for min-max \(k\)-cut

This page was built for publication: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques