Author: Chlebík Miroslav Chlebíková Janka
Publisher: Springer Publishing Company
ISSN: 1382-6905
Source: Journal of Combinatorial Optimization, Vol.11, Iss.3, 2006-05, pp. : 279-290
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
We provide the first interesting explicit lower bounds on efficient approximability for two closely related optimization problems in graphs,
Related content
A Note on Balancedness of Dominating Set Games
Journal of Combinatorial Optimization, Vol. 10, Iss. 4, 2005-12 ,pp. :