628 search results - page 31 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
107
Voted
SIAMNUM
2010
14 years 9 months ago
2010
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be usef...
260
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
221
Voted
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
116
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
142
click to vote
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...