Designing overlay multicast networks for streaming
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
Approximation algorithms for covering/packing integer programs
Journal of Computer and System Sciences
Cross-layer latency minimization in wireless networks with SINR constraints
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
International Journal of Parallel, Emergent and Distributed Systems
Real-Time Message Routing and Scheduling
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Universal packet routing with arbitrary bandwidths and transit times
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Packet routing: complexity and algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
A simpler proof for O(congestion+dilation) packet routing
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Hi-index | 0.00 |
We present the first constant-factor approximation algorithm for a fundamental problem: the store-and-forward packet routing problem on arbitrary networks. Furthermore, the queue sizes required at the edges are bounded by an absolute constant. Thus, this algorithm balances a global criterion (routing time) with a local criterion (maximum queue size) and shows how to get simultaneous good bounds for both. For this particular problem, approximating the routing time well, even without considering the queue sizes, was open. We then consider a class of such local vs. global problems in the context of covering integer programs and show how to improve the local criterion by a logarithmic factor by losing a constant factor in the global criterion.