Precedence-constrained covering problems with multiplicity constraints

Stavros G. Kolliopoulos () and Antonis Skarlatos ()
Additional contact information
Stavros G. Kolliopoulos: National and Kapodistrian University of Athens
Antonis Skarlatos: National and Kapodistrian University of Athens

Journal of Combinatorial Optimization, 2023, vol. 45, issue 4, No 11, 19 pages

Abstract: Abstract We study the approximability of covering problems when the set of items chosen to satisfy the covering constraints must form an ideal of a given partial order. We examine the general case with multiplicity constraints, where item i can be chosen up to $$d_i$$ d i times. For the basic precedence-constrained knapsack problem (PCKP) we answer an open question of McCormick et al. (Algorithmica 783:771–787, 2017) and show the existence of approximation algorithms with strongly-polynomial bounds. PCKP is a special case, with a single covering constraint, of a precedence-constrained covering integer program (PCCP). For a general PCCP where the number of covering constraints is $$m \ge 1,$$ m ≥ 1 , we show that an algorithm of Pritchard and Chakrabarty (Algorithmica 611:75–93, 2011) for covering integer programs can be extended to yield an f-approximation, where f is the maximum number of variables with nonzero coefficients in a covering constraint. This is nearly-optimal under standard complexity-theoretic assumptions and rather surprisingly matches the bound achieved for the problem without precedence constraints.

Keywords: Covering integer programs; Precedence constraints (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-01027-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:45:y:2023:i:4:d:10.1007_s10878-023-01027-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-023-01027-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().