628 search results - page 43 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
129
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
138
Voted
TAMC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
126
Voted
SIAMCOMP
2008
15 years 2 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
123
Voted
JACM
2000
15 years 2 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
139
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...