ESA
2010
Springer
13 years 6 months ago
2010
Springer
ESA
2010
Springer
13 years 6 months ago
2010
Springer
We define the robustness of a level set homology class of a function f : X R as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theor...
ESA
2010
Springer
13 years 6 months ago
2010
Springer
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), it is known that the geodesic diameter is determined...
ESA
2010
Springer
13 years 6 months ago
2010
Springer
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
ESA
2010
Springer
13 years 6 months ago
2010
Springer
ESA
2010
Springer
13 years 6 months ago
2010
Springer
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
ESA
2010
Springer
13 years 6 months ago
2010
Springer
ESA
2010
Springer
13 years 6 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
ESA
2010
Springer
13 years 6 months ago
2010
Springer
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
ESA
2010
Springer
13 years 6 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...