44 search results - page 8 / 9 » Poly-logarithmic Approximation Algorithms for Directed Vehic... |
121
Voted
ANOR
2010
15 years 1 months ago
2010
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
156
Voted
SPAA
1999
ACM
15 years 7 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
127
Voted
CIAC
2010
Springer
15 years 6 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
101
Voted
STOC
2004
ACM
16 years 3 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...
122
Voted
FOCS
2006
IEEE
15 years 8 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...