1671 search results - page 55 / 335 » On the Covering Steiner Problem |
131
Voted
STOC
2006
ACM
16 years 29 days ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
82
Voted
WINET
2008
15 years 16 days ago
2008
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
126
Voted
DCOSS
2011
Springer
14 years 14 days ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
101
click to vote
WEA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
108
Voted
CCCG
2001
15 years 2 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...