581 search results - page 75 / 117 » Approximation algorithms for constructing wavelength routing... |
STOC
2004
ACM
16 years 1 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
106
click to vote
ALGOSENSORS
2008
Springer
15 years 3 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
121
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
107
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
114
click to vote
CIAC
2006
Springer
15 years 5 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...