Document

# Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard

## File

LIPIcs.MFCS.2022.66.pdf
• Filesize: 0.71 MB
• 14 pages

## Cite As

Christian Komusiewicz and Nils Morawietz. Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 66:1-66:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.MFCS.2022.66

## Abstract

For PLS-complete local search problems, there is presumably no polynomial-time algorithm which finds a locally optimal solution, even though determining whether a solution is locally optimal and replacing it by a better one if this is not the case can be done in polynomial time. We study local search for Weighted Independent Set and Weighted Dominating Set with the 3-swap neighborhood. The 3-swap neighborhood of a vertex set S in G is the set of vertex sets which can be obtained from S by exchanging at most three vertices. We prove the following dichotomy: On the negative side, the problem of finding a 3-swap-optimal independent set or dominating set is PLS-complete. On the positive side, locally optimal independent sets or dominating sets can be found in polynomial time when allowing all 3-swaps except a) the swaps that remove two vertices from the current solution and add one vertex to the solution or b) the swaps that remove one vertex from the current solution and add two vertices to the solution.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Problems, reductions and completeness
• Theory of computation → Discrete optimization
• Theory of computation → Graph algorithms analysis
##### Keywords
• Local Search
• Graph problems
• 3-swap neighborhood
• PLS-completeness

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Diogo Vieira Andrade, Mauricio G. C. Resende, and Renato Fonseca F. Werneck. Fast local search for the maximum independent set problem. Journal of Heuristics, 18(4):525-547, 2012.
2. Shaowei Cai, Kaile Su, Chuan Luo, and Abdul Sattar. NuMVC: An efficient local search algorithm for minimum vertex cover. Journal of Artificial Intelligence Research, 46:687-716, 2013.
3. Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, and Renato F. Werneck. Accelerating local search for the maximum independent set problem. In Proceedings of the 15th International Symposium on Experimental Algorithms (SEA '16), volume 9685 of Lecture Notes in Computer Science, pages 118-133. Springer, 2016.
4. Robert Elsässer and Tobias Tscheuschner. Settling the complexity of local max-cut (almost) completely. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP '11), volume 6755 of Lecture Notes in Computer Science, pages 171-182. Springer, 2011. URL: https://doi.org/10.1007/978-3-642-22006-7_15.
5. David S. Johnson, Christos H. Papadimitriou, and Mihalis Yannakakis. How easy is local search? Journal of Computer and System Sciences, 37(1):79-100, 1988.
6. Maximilian Katzmann and Christian Komusiewicz. Systematic exploration of larger local search neighborhoods for the minimum vertex cover problem. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, (AAAI '17), pages 846-852. AAAI Press, 2017.
7. Brian W. Kernighan and Shen Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49(2):291-307, 1970.
8. Hartmut Klauck. On the hardness of global and local approximation. In Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT '96), volume 1097 of Lecture Notes in Computer Science, pages 88-99. Springer, 1996.
9. Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, and Renato F. Werneck. Finding near-optimal independent sets at scale. Journal of Heuristics, 23(4):207-229, 2017.
10. Ruizhi Li, Shuli Hu, Shaowei Cai, Jian Gao, Yiyuan Wang, and Minghao Yin. NuMWVC: A novel local search for minimum weighted vertex cover problem. Journal of the Operational Research Society, 71(9):1498-1509, 2020.
11. Wil Michiels, Emile H. L. Aarts, and Jan H. M. Korst. Theoretical aspects of local search. Monographs in Theoretical Computer Science. An EATCS Series. Springer, 2007.
12. Svatopluk Poljak. Integer linear programs and local search for max-cut. SIAM Journal on Computing, 24(4):822-839, 1995.
13. Alejandro A. Schäffer and Mihalis Yannakakis. Simple local search problems that are hard to solve. SIAM Journal on Computing, 20(1):56-87, 1991.
14. Shinichi Shimozono. Finding optimal subgraphs by local search. Theoretical Computer Science, 172(1-2):265-271, 1997.
X

Feedback for Dagstuhl Publishing