Faster and simpler algorithms for multicommodity flow and other fractional packing problems
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing
Problems Page 1 SIAM J. COMPUT. c 2007 Society for Industrial and Applied Mathematics …
Problems Page 1 SIAM J. COMPUT. c 2007 Society for Industrial and Applied Mathematics …
[BOOK][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
Approximating fractional multicommodity flow independent of the number of commodities
LK Fleischer - SIAM Journal on Discrete Mathematics, 2000 - SIAM
We describe fully polynomial time approximation schemes for various multicommodity flow
problems in graphs with m edges and n vertices. We present the first approximation scheme …
problems in graphs with m edges and n vertices. We present the first approximation scheme …
[BOOK][B] Network flow algorithms
DP Williamson - 2019 - books.google.com
Network flow theory has been used across a number of disciplines, including theoretical
computer science, operations research, and discrete math, to model not only problems in the …
computer science, operations research, and discrete math, to model not only problems in the …
Faster approximation schemes for fractional multicommodity flow problems
G Karakostas - ACM Transactions on Algorithms (TALG), 2008 - dl.acm.org
We present fully polynomial approximation schemes for concurrent multicommodity flow
problems that run in time of the minimum possible dependencies on the number of …
problems that run in time of the minimum possible dependencies on the number of …
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
A Madry - Proceedings of the forty-second ACM symposium on …, 2010 - dl.acm.org
We combine the work of Garg and Konemann, and Fleischer with ideas from dynamic graph
algorithms to obtain faster (1-ε)-approximation schemes for various versions of the …
algorithms to obtain faster (1-ε)-approximation schemes for various versions of the …
[BOOK][B] Potential function methods for approximately solving linear programming problems: theory and practice
D Bienstock - 2006 - books.google.com
Potential Function Methods For Approximately Solving Linear Programming Problems
breaks new ground in linear programming theory. The book draws on the research …
breaks new ground in linear programming theory. The book draws on the research …
Jetway: Minimizing costs on inter-datacenter video traffic
It is typical for video streaming service providers (such as NetFlix) to rely on services from
cloud providers (such as Amazon), in order to build a scalable video streaming platform with …
cloud providers (such as Amazon), in order to build a scalable video streaming platform with …
[PDF][PDF] Multicommodity network flows: A survey, part II: Solution methods
IL Wang - International Journal of Operations Research, 2018 - orstw.org.tw
The multicommodity network fl ow (MCNF) problem is an important and challenging topic in
many scheduling and routing applications. As a follow-up survey paper to the previous one …
many scheduling and routing applications. As a follow-up survey paper to the previous one …
Coordination complexity of parallel price-directive decomposition
MD Grigoriadis, LG Khachiyan - Mathematics of Operations …, 1996 - pubsonline.informs.org
The general block-angular convex resource sharing problem in K blocks and M nonnegative
block-separable coupling constraints is considered. Applications of this model are in …
block-separable coupling constraints is considered. Applications of this model are in …