367 search results - page 16 / 74 » Tight lower bounds for the online labeling problem |
SIROCCO
2004
13 years 10 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
WADS
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
FOCS
2007
IEEE
14 years 15 days ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
SPAA
2006
ACM
14 years 2 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...