Pick-and-choose heuristics for partial set covering

DOI10.1016/0166-218X(88)90087-XzbMath0676.05034MaRDI QIDQ1122585

William V. Gehrlein, Peter C. Fishburn

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

partial set covering problempick-and-choose heuristics

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Algorithms in computer science (68W99)

Related Items (2)

Linear extension majority cycles for small (n\(\leq 9)\) partial orders ⋮ Obituary: Peter C. Fishburn (1936--2021)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast approximation algorithm for the multicovering problem
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• A Greedy Heuristic for the Set-Covering Problem
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• An analysis of approximations for maximizing submodular set functions—I

This page was built for publication: Pick-and-choose heuristics for partial set covering