Sciweavers

TALG
2010
96views more  TALG 2010»
13 years 1 months ago
The compressed permuterm index
Paolo Ferragina, Rossano Venturini
TALG
2010
236views more  TALG 2010»
13 years 1 months ago
Length-bounded cuts and flows
Georg Baier, Thomas Erlebach, Alexander Hall, Ekke...
TALG
2010
95views more  TALG 2010»
13 years 1 months ago
How to probe for an extreme value
Ashish Goel, Sudipto Guha, Kamesh Munagala
TALG
2010
107views more  TALG 2010»
13 years 1 months ago
Finding equitable convex partitions of points in a polygon efficiently
John Gunnar Carlsson, Benjamin Armbruster, Yinyu Y...
TALG
2010
158views more  TALG 2010»
13 years 1 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
TALG
2010
93views more  TALG 2010»
13 years 1 months ago
Distributed error confinement
We initiate the study of error confinement in distributed applications, where the goal is that only nodes that were directly hit by a fault may deviate from their correct external...
Yossi Azar, Shay Kutten, Boaz Patt-Shamir
TALG
2010
93views more  TALG 2010»
13 years 1 months ago
Efficient algorithms for the 2-gathering problem
Alon Shalita, Uri Zwick
TALG
2010
83views more  TALG 2010»
13 years 1 months ago
Finding shortest contractible and shortest separating cycles in embedded graphs
We give a polynomial-time algorithm to find a shortest contractible cycle (i.e. a closed walk without repeated vertices) in a graph embedded in a surface. This answers a question ...
Sergio Cabello
TALG
2010
123views more  TALG 2010»
13 years 4 months ago
Lower-bounded facility location
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
Zoya Svitkina