192 search results - page 28 / 39 » A Constant-Factor Approximation Algorithm for the Multicommo... |
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
FOCS
2008
IEEE
14 years 3 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...
COCO
2004
Springer
14 years 10 days ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
FSTTCS
2003
Springer
14 years 1 months ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...