Approximation Algorithms for k-Hurdle Problems
From MaRDI portal
Publication:5458550
DOI10.1007/978-3-540-78773-0_39zbMath1136.68454OpenAlexW2690325572MaRDI QIDQ5458550
Brian C. Dean, Adam Griffis, Adam Whitley
Publication date: 15 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_39
Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual approximation algorithms for integral flow and multicut in trees
- A polynomial-time simplex method for the maximum \(k\)-flow problem
- Packing and covering a tree by subtrees
- An improved approximation algorithm of MULTIWAY CUT.
- Deterministic network interdiction
- Optimal 3-terminal cuts and linear programming
- On budget-constrained flow improvement.
- Rounding algorithms for a geometric embedding of minimum multiway cut
- Finding Minimum-Cost Circulations by Successive Approximation
- Approximating the k-multicut problem
- Optimal attack and reinforcement of a network
- Maximizing the minimum source-sink path subject to a budget constraint
- The Complexity of Multiterminal Cuts
- Disjoint (s, t)‐cuts in a network
- Shortest-path network interdiction
- Multiway cuts in node weighted graphs
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- The network inhibition problem
- Algorithm Theory - SWAT 2004
- Approximation and Online Algorithms
