ESA
2009
Springer
14 years 6 months ago
2009
Springer
According to a classical result of Gr¨unbaum, the transversal number τ(F) of any family F of pairwise-intersecting translates or homothets of a convex body C in Rd is bounded by...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
ESA
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. A mobile robot, represented by a point moving along a polygonal line in the plane, has to explore an unknown polygon and return to the starting point. The robot has a sen...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
We evaluate the practical performance of labeling schemes for lowest common ancestors in trees. We develop different variants for encoding the labels. We then perform a thorough e...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
The purpose of this brief note is to describe recent work in the area of cuckoo hashing, including a clear description of several open problems, with the hope of spurring further r...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
ESA
2009
Springer
14 years 6 months ago
2009
Springer
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...