Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
From MaRDI portal
Publication:3638069
DOI10.1007/978-3-642-02927-1_53zbMath1248.68561OpenAlexW1791603240MaRDI QIDQ3638069
Christos Koufogiannakis, Neal E. Young
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_53
Related Items (9)
Approximability of sparse integer programs ⋮ Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost ⋮ Approximating integer programs with positive right-hand sides ⋮ Distributed algorithms for covering, packing and maximum weighted matching ⋮ Evader interdiction: algorithms, complexity and collateral damage ⋮ LP-based covering games with low price of anarchy ⋮ Graph cuts with interacting edge weights: examples, approximations, and algorithms ⋮ Approximating Sparse Covering Integer Programs Online ⋮ Complexity and approximations for submodular minimization problems on two variables per inequality constraints
This page was built for publication: Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
