119 search results - page 3 / 24 » Linear-Time Algorithms for Parametric Minimum Spanning Tree ... |
IPPS
2003
IEEE
13 years 10 months ago
2003
IEEE
ESA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
ICPADS
2007
IEEE
13 years 11 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
SODA
2004
ACM
13 years 6 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 ...