Startseite > Publikationen > Publikationen

Publikationen

Dumrauf, Dominic;Suess, Tim:

On the Complexity of Local Search for Weighted Standard Set Problems.

In: Proc. 6th Conference on Computability in Europe, S. 132-140, 30. Jun. - 4. Jul. 2010

Abstract

In this paper, we study the complexity of computing locally optimal solutions for weighted versions of standard set problems such as SETCOVER, SETPACKING, and many more. For our investigation, we use the framework of PLS, as defined in Johnson et al., [14]. We show that for most of these problems, computing a locally optimal solution is already PLS-complete for a simple neighborhood of size one. For the local search versions of weighted SETPACKING and SETCOVER, we derive tight bounds for a simple neighborhood of size two. To the best of our knowledge, these are one of the very few PLS results about local search for weighted standard set problems.

Bibtex

@inproceedings{hniid=4845,
author = {Dumrauf, Dominic and Suess, Tim},
title = {On the Complexity of Local Search for Weighted Standard Set Problems},
booktitle = {Proc. 6th Conference on Computability in Europe},
pages = {132-140},
month = {30~} # jun # { - 4~} # jul,
year = {2010},
}

BibTeX in die Zwischenablage kopieren

Permalink

https://www.hni.uni-paderborn.de/pub/4845