Approximation Hardness of the Mixed Dominating Set Problem

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.

Abstract

Abstract is missing.