628 search results - page 54 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
117
click to vote
SIROCCO
2004
15 years 4 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
150
click to vote
SODA
2003
ACM
15 years 4 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
127
click to vote
ALGORITHMICA
2005
15 years 3 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
156
click to vote
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
136
click to vote
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...