105 search results - page 13 / 21 » A 3-Approximation for the Minimum Tree Spanning k Vertices |
138
click to vote
OL
2011
14 years 6 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
TAMC
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
122
click to vote
CCCG
2003
15 years 15 days ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
ICPP
2005
IEEE
15 years 4 months ago
2005
IEEE
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
JOIN
2007
14 years 11 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...