287 search results - page 37 / 58 » Constant Factor Approximations for the Hotlink Assignment Pr... |
148
Voted
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
149
Voted
STACS
2001
Springer
15 years 8 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
128
Voted
IJCAI
2003
15 years 4 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
149
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
171
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...