Search results for "multicommodity flows"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Hiroshi Hirai	The maximum multiflow problems with bounded fractionality.	STOC	2010	DBLP DOI BibTeX RDF	metrics, polynomial time algorithms, multicommodity flows
2	Baruch Awerbuch, Rohit Khandekar	Distributed network monitoring and multicommodity flows: a primal-dual approach.	PODC	2007	DBLP DOI BibTeX RDF	passive network measurement, distributed algorithms, multi-commodity flows
2	Alexander Hall, Steffen Hippler, Martin Skutella	Multicommodity Flows over Time: Efficient Algorithms and Complexity.	ICALP	2003	DBLP DOI BibTeX RDF	flow over time, dynamic flow, routing, complexity, network flow, efficient algorithm
1	Jordi Castro, Jordi Cuesta	Improving an interior-point algorithm for multicommodity flows by quadratic regularizations.	Networks	2012	DBLP DOI BibTeX RDF
1	Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath	Multicommodity flows and cuts in polymatroidal networks.	ITCS	2012	DBLP DOI BibTeX RDF
1	Hiroshi Hirai, Shungo Koichi	On duality and fractionality of multicommodity flows in directed networks.	Discrete Optimization	2011	DBLP DOI BibTeX RDF
1	Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath	Multicommodity Flows and Cuts in Polymatroidal Networks	CoRR	2011	DBLP BibTeX RDF
1	Kyungsik Lee	Integral polyhedra related to integer multicommodity flows on a cycle.	Discrete Applied Mathematics	2010	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Ankur Moitra	Extensions and limits to vertex sparsification.	STOC	2010	DBLP DOI BibTeX RDF	oblivious reductions, multicommodity flow
1	Dániel Marx	Tractable hypergraph properties for constraint satisfaction and conjunctive queries.	STOC	2010	DBLP DOI BibTeX RDF	submodular width, constraint satisfaction, conjunctive queries, fixed-parameter tractability
1	Di Wang, Robert Kleinberg	Analyzing quadratic unconstrained binary optimization problems via multicommodity flows.	Discrete Applied Mathematics	2009	DBLP DOI BibTeX RDF
1	Sanjeev Arora, Satish Rao, Umesh V. Vazirani	Expander flows, geometric embeddings and graph partitioning.	J. ACM	2009	DBLP DOI BibTeX RDF	Graph partitioning, semidefinite programs, multicommodity flows, expanders, expansion, graph separators
1	Rohit Khandekar, Satish Rao, Umesh V. Vazirani	Graph partitioning using single commodity flows.	J. ACM	2009	DBLP DOI BibTeX RDF	Edge-separator, single commodity max-flow, sparse cut, spectral method
1	Shirish S. Karande, Zheng Wang, Hamid R. Sadjadpour, Jose Joaquin Garcia-Luna-Aceves	Optimal scaling of multicommodity flows in wireless ad hoc networks: Beyond the Gupta-Kumar barrier.	MASS	2008	DBLP DOI BibTeX RDF
1	Baruch Awerbuch, Rohit Khandekar	Greedy distributed optimization of unsplittable multicommodity flows.	PODC	2008	DBLP DOI BibTeX RDF
1	Baruch Awerbuch, Rohit Khandekar	Stateless distributed algorithms for near optimal maximum multicommodity flows.	PODC	2008	DBLP DOI BibTeX RDF
1	George Karakostas	Faster approximation schemes for fractional multicommodity flow problems.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	Multicommodity flows, fully-polynomial time approximation schemes
1	Amit Chakrabarti, Alexander Jaffe, James R. Lee, Justin Vincent	Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums.	FOCS	2008	DBLP DOI BibTeX RDF
1	Ojas Parekh, Danny Segev	Path Hitting in Acyclic Graphs.	Algorithmica	2008	DBLP DOI BibTeX RDF	Edge cover, Tree augmentation, Tree multicut, Approximation algorithms, Linear programming, Primal-dual, Edge dominating set
1	Yuri Rabinovich	On Average Distortion of Embedding Metrics into the Line.	Discrete & Computational Geometry	2008	DBLP DOI BibTeX RDF	Average distortion, Metric embeddings
1	Alexander Hall, Steffen Hippler, Martin Skutella	Multicommodity flows over time: Efficient algorithms and complexity.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	Alexander Hall, Katharina Langkau, Martin Skutella	An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.	Algorithmica	2007	DBLP DOI BibTeX RDF
1	Oktay Günlük	A New Min-Cut Max-Flow Ratio for Multicommodity Flows.	SIAM J. Discrete Math.	2007	DBLP DOI BibTeX RDF
1	Ilan Newman, Yuri Rabinovich	Hard Metrics from Cayley Graphs of Abelian Groups.	STACS	2007	DBLP DOI BibTeX RDF
1	Dmitrii Lozovanu, Maria Fonoberova	Optimal Dynamic Multicommodity Flows in Networks.	Electronic Notes in Discrete Mathematics	2006	DBLP DOI BibTeX RDF
1	Mohammad Taghi Hajiaghayi, Tom Leighton	On the max-flow min-cut ratio for directed multicommodity flows.	Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
1	Young-Soo Myung	Multicommodity flows in cycle graphs.	Discrete Applied Mathematics	2006	DBLP DOI BibTeX RDF
1	George Tsaggouris, Christos D. Zaroliagis	QoS-aware Multicommodity Flows and Transportation Planning.	ATMOS	2006	DBLP BibTeX RDF
1	Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman	On the capacity of information networks.	SODA	2006	DBLP DOI BibTeX RDF
1	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton	Semi-oblivious routing.	SPAA	2006	DBLP DOI BibTeX RDF
1	Rohit Khandekar, Satish Rao, Umesh V. Vazirani	Graph partitioning using single commodity flows.	STOC	2006	DBLP DOI BibTeX RDF	edge-separator, single commodity max-flow, sparse cut, spectral method
1	Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman	On the capacity of information networks.	IEEE Transactions on Information Theory	2006	DBLP DOI BibTeX RDF	infomational dominance, k-pairs communication problems, multiple unicast sessions, capacity, network coding, multicommodity flow, sparsity
1	Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd	Multicommodity flow, well-linked terminals, and routing problems.	STOC	2005	DBLP DOI BibTeX RDF	all-or-nothing flow, flow-cut gaps, network routing, multicommodity flow, disjoint paths
1	Jean François Maurras, Sonia Vanier	Network synthesis under survivability constraints.	4OR	2004	DBLP DOI BibTeX RDF	Survivable telecommunication networks, routing, complexity, multicommodity flows
1	Adam Ouorou	Epsilon-proximal decomposition method.	Math. Program.	2004	DBLP DOI BibTeX RDF	proximal point algorithms, large-scale programming, decomposition, convex optimization, multicommodity flows, cutting planes
1	Krzysztof Walkowiak	A New Method of Primary Routes Selection for Local Restoration.	NETWORKING	2004	DBLP DOI BibTeX RDF
1	Norbert Sensen	Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows.		2003	RDF
1	Alexander Hall, Katharina Langkau, Martin Skutella	An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
1	Brian Towles, William J. Dally, Stephen P. Boyd	Throughput-centric routing algorithm design.	SPAA	2003	DBLP DOI BibTeX RDF	interconnection networks, multicommodity flows, oblivious routing
1	Jordi Castro	Solving Difficult Multicommodity Problems with a Specialized Interior-Point Algorithm.	Annals OR	2003	DBLP DOI BibTeX RDF	linear programming, interior-point methods, multicommodity flows, network optimization
1	Oktay Günlük	A New Min-Cut Max-Flow Ratio for Multicommodity Flows.	IPCO	2002	DBLP BibTeX RDF
1	Naveen Garg, Rohit Khandekar	Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems.	FOCS	2002	DBLP DOI BibTeX RDF
1	Lisa Fleischer, Martin Skutella	The Quickest Multicommodity Flow Problem.	IPCO	2002	DBLP BibTeX RDF
1	F. Bruce Shepherd, Lisa Zhang	A cycle augmentation algorithm for minimum cost multicommodity flows on a ring.	Discrete Applied Mathematics	2001	DBLP DOI BibTeX RDF
1	Norbert Sensen	Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows.	ESA	2001	DBLP DOI BibTeX RDF
1	Jack Shaio	Constraint Generation for Network Reliability Problems.	Annals OR	2001	DBLP DOI BibTeX RDF	networks/graphs, mathematical programming, multicommodity flows, network reliability
1	Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky	Practical Approximation Algorithms for Separable Packing Linear Programs.	WADS	2001	DBLP DOI BibTeX RDF
1	Anand Srivastav, Peter Stangier	On Complexity, Representation and Approximation of Integral Multicommodity Flows.	Discrete Applied Mathematics	2000	DBLP DOI BibTeX RDF
1	Naveen Garg, Jochen Könemann	Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems.	FOCS	1998	DBLP DOI BibTeX RDF
1	Karsten Weihe	Multicommodity Flows in Even, Planar Networks.	Algorithmica	1997	DBLP DOI BibTeX RDF
1	Bo Yu, Joseph Cheriyan, Penny E. Haxell	Hypercubes and Multicommodity Flows.	SIAM J. Discrete Math.	1997	DBLP DOI BibTeX RDF
1	Michael D. Grigoriadis, Leonid G. Khachiyan	Approximate minimum-cost multicommodity flows in Õ(epsilon-2KNM) time.	Math. Program.	1996	DBLP DOI BibTeX RDF
1	Sanjiv Kapoor, Pravin M. Vaidya	Speeding up Karmarkar's algorithm for multicommodity flows.	Math. Program.	1996	DBLP DOI BibTeX RDF
1	Rita Vachani, Alexander Shulman, Peter Kubat, Julie Ward	Multicommodity Flows in Ring Networks.	INFORMS Journal on Computing	1996	DBLP DOI BibTeX RDF
1	Serge A. Plotkin, Éva Tardos	Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows.	Combinatorica	1995	DBLP DOI BibTeX RDF
1	David R. Karger, Serge A. Plotkin	Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows.	STOC	1995	DBLP DOI BibTeX RDF
1	Anand Srivastav, Peter Stangier	Integer Multicommodity Flows with Reduced Demands.	ESA	1993	DBLP DOI BibTeX RDF
1	Karsten Weihe	Multicommodity Flows in Even, Planar Networks.	ISAAC	1993	DBLP DOI BibTeX RDF
1	Baruch Awerbuch, Frank Thomson Leighton	Multicommodity Flows: A Survey of Recent Research.	ISAAC	1993	DBLP DOI BibTeX RDF
1	Serge A. Plotkin, Éva Tardos	Improved bounds on the max-flow min-cut ratio for multicommodity flows.	STOC	1993	DBLP DOI BibTeX RDF
1	Alexander Schrijver	Short proofs on multicommodity flows and cuts.	J. Comb. Theory, Ser. B	1991	DBLP DOI BibTeX RDF
1	Hiroshi Nagamochi, Toshihide Ibaraki	Multicommodity flows in certain planar directed networks.	Discrete Applied Mathematics	1990	DBLP DOI BibTeX RDF
1	Michael Kaufmann	A linear-time algorithm for routing in a convex grid.	IEEE Trans. on CAD of Integrated Circuits and Systems	1990	DBLP DOI BibTeX RDF
1	Hiroshi Nagamochi, Toshihide Ibaraki	On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks.	Inf. Process. Lett.	1989	DBLP DOI BibTeX RDF
1	Cor A. J. Hurkens, Alexander Schrijver, Éva Tardos	On fractional multicommodity flows and distance functions.	Discrete Mathematics	1989	DBLP DOI BibTeX RDF
1	Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito	Algorithms for Multicommodity Flows in Planar Graphs.	Algorithmica	1989	DBLP DOI BibTeX RDF
1	Alexander Schrijver	The Klein bottle and multicommodity flows.	Combinatorica	1989	DBLP DOI BibTeX RDF
1	Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito	Planar Multicommodity Flows, Maximum Matchings and Negative Cycles.	SIAM J. Comput.	1986	DBLP DOI BibTeX RDF
1	Sanjiv Kapoor, Pravin M. Vaidya	Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows	STOC	1986	DBLP DOI BibTeX RDF
1	Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito	An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks.	SIAM J. Comput.	1985	DBLP DOI BibTeX RDF
1	Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito	Multicommodity Flows in Planar Undirected Graphs and Shortest Paths	STOC	1985	DBLP DOI BibTeX RDF