1461 search results - page 17 / 293 » Complexity of Graph Covering Problems |
SIROCCO
2001
13 years 8 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
DAM
2006
13 years 7 months ago
2006
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
COR
2000
13 years 7 months ago
2000
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
ANTSW
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...