Approximation and Online Algorithms

DOI10.1007/B106130MaRDI QIDQ5713434zbMATH OpenOpenAlexFDO

Authors Toshihiro Fujito, Takatoshi Yabuta

Publication date 14 December 2005

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

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

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30)

Recommendations

• On approximation of the submodular set cover problem
• Prize‐collecting set multicovering with submodular pricing
• Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties
• A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
• The multi‐integer set cover and the facility terminal cover problem

Cited in

(6)

• Primal-dual algorithms for precedence constrained covering problems
• Approximability of sparse integer programs
• Primal-dual algorithms for precedence constrained covering problems
• On improved interval cover mechanisms for crowdsourcing markets
• Analysis of fractional covering of some supply management problems
• Algorithmic Applications in Management

This page was built for publication: Approximation and Online Algorithms

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