138 search results - page 4 / 28 » Fast Approximation Algorithms for Cut-based Problems in Undi... |
ESA
2007
Springer
13 years 12 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
FOCS
2006
IEEE
13 years 12 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
ESA
2007
Springer
13 years 12 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
DAM
2000
13 years 5 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
ISAAC
1998
Springer
13 years 10 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...