2016
DOI: 10.1016/j.orl.2016.03.001
|View full text |Cite
|
Sign up to set email alerts
|

A constructive proof of Swap Local Search worst-case instances for the Maximum Coverage Problem

Abstract: a b s t r a c tWe consider the Maximum Weighted Coverage problem (MCP). We can relate the MCP to optimisation problems using submodular functions. Performance guarantees of the Swap Local Search algorithm are known for these problems, but can be improved for the MCP. Our main contribution is a constructive proof of tight performance guarantees for Swap Local Search applied to the MCP, which provides insight into the structure of worst-case MCP instances, and has the potential to be applicable to other optimisa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…In this paper, we study the effectiveness of local search for geometric MC problems. In the general case, b-swap local search is known to yield a tight approximation ratio of 1/2 [23]. However, for special cases such as geometric MC problems local search is a promising candidate for beating the barrier 1 − 1/e.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, we study the effectiveness of local search for geometric MC problems. In the general case, b-swap local search is known to yield a tight approximation ratio of 1/2 [23]. However, for special cases such as geometric MC problems local search is a promising candidate for beating the barrier 1 − 1/e.…”
Section: Introductionmentioning
confidence: 99%