Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-14165-2_22
Full Text
Open PDFAbstract
Available in full text
Date
January 1, 2010
Authors
Publisher
Springer Berlin Heidelberg