274 search results - page 26 / 55 » The Polymatroid Steiner Problems |
114
Voted
SODA
1992
ACM
15 years 1 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
125
Voted
COMGEO
2006
ACM
15 years 22 days ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
99
Voted
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
A rectilinear Steiner arborescence connects points in the Euclidean plane’s first quadrant and the origin with directed rectilinear edges from the origin up and to the right. Th...
127
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
100
Voted
STOC
2003
ACM
16 years 1 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 ...