723 search results - page 109 / 145 » On the hyperbolicity constant in graphs |
155
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
157
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
147
click to vote
CAV
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
159
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
160
click to vote
ICALP
1990
Springer
15 years 10 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...