Approximation Algorithms for k-Hurdle Problems

DOI10.1007/978-3-540-78773-0_39zbMATH Open1136.68454OpenAlexW2690325572MaRDI QIDQ5458550FDOQ5458550

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

Recommendations

• Approximation algorithms for \(k\)-hurdle problems
• scientific article; zbMATH DE number 1775387
• Generalized \(k\)-multiway cut problems
• Improved region-growing and combinatorial algorithms for \(k\)-route cut problems (extended abstract)
• Algorithm Theory - SWAT 2004

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Cites Work

• Title not available (Why is that?)
• Optimal 3-terminal cuts and linear programming
• The Complexity of Multiterminal Cuts
• Multiway cuts in node weighted graphs
• Deterministic network interdiction
• Finding Minimum-Cost Circulations by Successive Approximation
• On budget-constrained flow improvement.
• Rounding algorithms for a geometric embedding of minimum multiway cut
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
• Shortest-path network interdiction
• Maximizing the minimum source-sink path subject to a budget constraint
• Primal-dual approximation algorithms for integral flow and multicut in trees
• Title not available (Why is that?)
• Optimal attack and reinforcement of a network
• Packing and covering a tree by subtrees
• Approximating the k-multicut problem
• Disjoint (s, t)‐cuts in a network
• An improved approximation algorithm of MULTIWAY CUT.
• The network inhibition problem
• Algorithm Theory - SWAT 2004
• Approximation and Online Algorithms
• Title not available (Why is that?)
• A polynomial-time simplex method for the maximum \(k\)-flow problem

Cited In (1)

• Approximation algorithms for \(k\)-hurdle problems

This page was built for publication: Approximation Algorithms for k-Hurdle Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458550)