1671 search results - page 74 / 335 » On the Covering Steiner Problem |
113
Voted
SIROCCO
2001
15 years 2 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...
92
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we present semidefinite programming (SDP) gap instances for the following variants of the Label-Cover problem, closely related to the Unique Games Conjecture: (i) 2-...
103
click to vote
COMGEO
2008
ACM
15 years 24 days ago
2008
ACM
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red ...
123
click to vote
ML
2008
ACM
15 years 20 days ago
2008
ACM
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
91
Voted
MST
2007
15 years 6 days ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...