New and Improved Bounds for the Minimum Set Cover Problem
Attributed to:
The Centre for Discrete Mathematics and its Applications (DIMAP)
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-32512-0_25
Publication URI: http://dx.doi.org/10.1007/978-3-642-32512-0_25
Type: Book Chapter
Book Title: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2012)
Page Reference: 288-300
ISBN: 978-3-642-32511-3