Sciweavers

672 search results - page 83 / 135
» Lower-stretch spanning trees
Sort
View
124
Voted
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 9 months ago
: Standard Template Library for XXL Data Sets
Abstract. We present a software library Stxxl, that enables practiceoriented experimentation with huge data sets. Stxxl is an implementation of the C++ standard template library ST...
Roman Dementiev, Lutz Kettner, Peter Sanders
121
Voted
PODC
2003
ACM
15 years 9 months ago
Adapting to a reliable network path
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
Baruch Awerbuch, Yishay Mansour
134
Voted
COMPGEOM
1993
ACM
15 years 7 months ago
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
Rolf Klein, Andrzej Lingas
140
Voted
COCOON
2006
Springer
15 years 7 months ago
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
137
Voted
IPCO
2010
184views Optimization» more  IPCO 2010»
15 years 5 months ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga