TY - GEN
T1 - Maximum minimal vertex cover parameterized by vertex cover
AU - Zehavi, Meirav
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2015.
PY - 2015/1/1
Y1 - 2015/1/1
N2 - The parameterized complexity of problems is often studied with respect to the size of their optimal solutions. However, for a maximization problem, the size of the optimal solution can be very large, rendering algorithms parameterized by it inefficient. Therefore, we suggest to study the parameterized complexity of maximization problems with respect to the size of the optimal solutions to their minimization versions. We examine this suggestion by considering the Maximum Minimal Vertex Cover (MMVC) problem, whose minimization version, Vertex Cover, is one of the most studied problems in the field of Parameterized Complexity. Our main contribution is a parameterized approximation algorithm for MMVC, including its weighted variant. We also give conditional lower bounds for the running times of algorithms for MMVC and its weighted variant.
AB - The parameterized complexity of problems is often studied with respect to the size of their optimal solutions. However, for a maximization problem, the size of the optimal solution can be very large, rendering algorithms parameterized by it inefficient. Therefore, we suggest to study the parameterized complexity of maximization problems with respect to the size of the optimal solutions to their minimization versions. We examine this suggestion by considering the Maximum Minimal Vertex Cover (MMVC) problem, whose minimization version, Vertex Cover, is one of the most studied problems in the field of Parameterized Complexity. Our main contribution is a parameterized approximation algorithm for MMVC, including its weighted variant. We also give conditional lower bounds for the running times of algorithms for MMVC and its weighted variant.
UR - http://www.scopus.com/inward/record.url?scp=84944588548&partnerID=8YFLogxK
U2 - 10.1007/978-3-662-48054-0_49
DO - 10.1007/978-3-662-48054-0_49
M3 - Conference contribution
AN - SCOPUS:84944588548
SN - 9783662480533
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 589
EP - 600
BT - Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Proceedings
A2 - Italiano, Giuseppe F.
A2 - Pighizzini, Giovanni
A2 - Sannella, Donald T.
PB - Springer Verlag
T2 - 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015
Y2 - 24 August 2015 through 28 August 2015
ER -