Solving Robust Weighted Independent Set Problems on Trees and under Interval Uncertainty
Open Access
- 27 November 2021
- Vol. 13 (12), 2259
- https://doi.org/10.3390/sym13122259
Abstract
The maximum weighted independent set (MWIS) problem is important since it occurs in various applications, such as facility location, selection of non-overlapping time slots, labeling of digital maps, etc. However, in real-life situations, input parameters within those models are often loosely defined or subject to change. For such reasons, this paper studies robust variants of the MWIS problem. The study is restricted to cases where the involved graph is a tree. Uncertainty of vertex weights is represented by intervals. First, it is observed that the max–min variant of the problem can be solved in linear time. Next, as the most important original contribution, it is proved that the min–max regret variant is NP-hard. Finally, two mutually related approximation algorithms for the min–max regret variant are proposed. The first of them is already known, but adjusted to the considered situation, while the second one is completely new. Both algorithms are analyzed and evaluated experimentally.Keywords
Funding Information
- Croatian Science Foundation (IP-2018-01-5591)
This publication has 13 references indexed in Scilit:
- Temporal map labelingPublished by Association for Computing Machinery (ACM) ,2016
- Robust Discrete Optimization Under Discrete and Interval Uncertainty: A SurveyInternational Series in Operations Research & Management Science, 2016
- Complexity of the robust weighted independent set problems on interval graphsOptimization Letters, 2014
- Robust maximum weighted independent-set problems on interval graphsOptimization Letters, 2012
- Combinatorial OptimizationPublished by Springer Science and Business Media LLC ,2012
- Theory and Applications of Robust OptimizationSIAM Review, 2011
- Min–max and min–max regret versions of combinatorial optimization problems: A surveyEuropean Journal of Operational Research, 2009
- Selection of programme slots of television channels for giving advertisement: A graph theoretic approachInformation Sciences, 2007
- A sequential algorithm for finding a maximum weightK-independent set on interval graphsInternational Journal of Computer Mathematics, 1996
- An optimal time algorithm for finding a maximum weight independent set in a treeBIT Numerical Mathematics, 1988