628 search results - page 69 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
123
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
131
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
110
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
178
Voted
DAM
2011
14 years 10 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
137
click to vote
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...