Approximations for Restrictions of The Budgeted and Generalized Maximum Coverage Problems

In this paper we present approximation preserving reductions from the Budgeted and Generalized Maximum Coverage Problems to the Knapsack Problem with Conflict Graphs. The reductions are used to yield Polynomial Time Approximation Schemes for special classes of instances of these problems. Using thes...

Full description

Saved in:

Bibliographic Details
Published in:	Electronic notes in theoretical computer science Vol. 346; pp. 667 - 676
Main Author:	Piva, Breno
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 30.08.2019
Subjects:	Approximation Algorithm Budgeted Maximum Coverage Generalized Maximum Coverage Knapsack with Conflict Graph Pseudo-polynomial Algorithm Budgeted Maximum Coverage Knapsack with Conflict Graph Approximation Algorithm Pseudo-polynomial Algorithm Generalized Maximum Coverage
ISSN:	1571-0661, 1571-0661
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	In this paper we present approximation preserving reductions from the Budgeted and Generalized Maximum Coverage Problems to the Knapsack Problem with Conflict Graphs. The reductions are used to yield Polynomial Time Approximation Schemes for special classes of instances of these problems. Using these approximation schemes, the existence of pseudo-polynomial algorithms are proven and, in more particular cases, these algorithms are shown to have polynomial time complexity. Moreover, the characteristics of the instances that admit these algorithms are analyzed.
ISSN:	1571-0661 1571-0661
DOI:	10.1016/j.entcs.2019.08.058