Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Publication:5479358
DOI10.1007/11538462zbMath1142.68605OpenAlexW2649657569MaRDI QIDQ5479358
Mohammad R. Salavatipour, Joseph Cheriyan
Publication date: 7 July 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11538462
Related Items (4)
On Element-Connectivity Preserving Graph Simplification ⋮ Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs ⋮ Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs ⋮ Disjoint bases in a polymatroid
This page was built for publication: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
