Partial Interval Set Cover – Trade-Offs between Scalability and Optimality

DOI10.1007/978-3-642-40328-6_9MaRDI QIDQ2851852zbMATH OpenOpenAlexFDO

Authors Katherine Edwards, Simon Griffiths, W. Sean Kennedy

Publication date 4 October 2013

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40328-6_9

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• Approximation algorithm for partial set multicover versus full set multicover
• Approximation algorithm for the partial set multi-cover problem
• scientific article; zbMATH DE number 6815827
• Partial sublinear time approximation and inapproximation for maximum coverage
• Parallel approximation for partial set cover
• Approximation algorithms for partial covering problems
• The set cover problem with interval weights and the greedy algorithm for its solution
• scientific article; zbMATH DE number 1754596
• On combinatorial approximation of covering 0-1 integer programs and partial set cover
• Set-cover approximation

Cited in

(3)

• Calculating approximation guarantees for partial set cover of pairs
• Refined algorithms for hitting many intervals
• A simple approximation algorithm for minimum weight partial connected set cover

This page was built for publication: Partial Interval Set Cover – Trade-Offs between Scalability and Optimality

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