Yen Hung Chen. Approximation Hardness of the Mixed Dominating Set Problem. In Andreas Brieden, Zafer-Korcan Görgülü, Tino Krug, Erik Kropat, Silja Meyer-Nieberg, Goran Mihelcic, Stefan Wolfgang Pickl, editors, 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Munich, Germany, May 29-31, 2012. Extended Abstracts. pages 71-75, 2012.
@inproceedings{Chen12-28,
title = {Approximation Hardness of the Mixed Dominating Set Problem},
author = {Yen Hung Chen},
year = {2012},
researchr = {https://researchr.org/publication/Chen12-28},
cites = {0},
citedby = {0},
pages = {71-75},
booktitle = {11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Munich, Germany, May 29-31, 2012. Extended Abstracts},
editor = {Andreas Brieden and Zafer-Korcan Görgülü and Tino Krug and Erik Kropat and Silja Meyer-Nieberg and Goran Mihelcic and Stefan Wolfgang Pickl},
isbn = {978-3-943207-05-7},
}