446 search results - page 1 / 90 » A fast algorithm for computing steiner edge connectivity |
STOC
2003
ACM
14 years 4 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 ...
COR
2011
12 years 11 months ago
2011
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
INFOCOM
1996
IEEE
13 years 8 months ago
1996
IEEE
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
ISPD
2005
ACM
13 years 10 months ago
2005
ACM
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...