TY - GEN
T1 - Non-existence of Additive Approximations for the Black-and-White Coloring Problem
AU - Zucker, Shira
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.
PY - 2026/1/1
Y1 - 2026/1/1
N2 - The Black-and-White Coloring (BWC) problem seeks a coloring of a graph’s vertices, minimizing the number of edges with endpoints of different colors, given a fixed number of black and white vertices. This problem is known to be NP-complete. We prove that no polynomial-time algorithm can achieve an additive approximation for this problem, unless P = NP.
AB - The Black-and-White Coloring (BWC) problem seeks a coloring of a graph’s vertices, minimizing the number of edges with endpoints of different colors, given a fixed number of black and white vertices. This problem is known to be NP-complete. We prove that no polynomial-time algorithm can achieve an additive approximation for this problem, unless P = NP.
UR - https://www.scopus.com/pages/publications/105027220538
U2 - 10.1007/978-3-032-08381-4_31
DO - 10.1007/978-3-032-08381-4_31
M3 - Conference contribution
AN - SCOPUS:105027220538
SN - 9783032083807
T3 - Lecture Notes in Networks and Systems
SP - 393
EP - 396
BT - Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 5th International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences - MCO 2025
A2 - Le Thi, Hoai An
A2 - Pham Dinh, Tao
A2 - Le, Hoai Minh
PB - Springer Science and Business Media Deutschland GmbH
T2 - 5th International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, MCO 2025
Y2 - 4 June 2025 through 6 June 2025
ER -