Stateless distributed gradient descent for positive linear programs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
COLA: optimizing stream processing applications via graph partitioning
Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
COLA: optimizing stream processing applications via graph partitioning
Middleware'09 Proceedings of the ACM/IFIP/USENIX 10th international conference on Middleware
Optimal content placement for a large-scale VoD system
Proceedings of the 6th International COnference
On minimizing average end-to-end delay in P2P live streaming systems
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Maximising lifetime for fault-tolerant target coverage in sensor networks
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Brief announcement: bridging the theory-practice gap in multi-commodity flow routing
DISC'11 Proceedings of the 25th international conference on Distributed computing
Wireless coverage with disparate ranges
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Ranking with submodular valuations
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Efficient submodular function maximization under linear packing constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering
IEEE/ACM Transactions on Networking (TON)
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
ACM Transactions on Algorithms (TALG)
BonnRoute: Algorithms and data structures for fast and good VLSI routing
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Content placement via the exponential potential function method
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Computational Optimization and Applications
Bin covering with cardinality constraints
Discrete Applied Mathematics
| Hi-index | 0.00 |
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We present new, faster, and much simpler algorithms for these problems.