The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for multicommodity with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1966-1976 (16) 1977-1981 (16) 1983-1989 (19) 1990-1991 (17) 1992-1993 (27) 1994-1995 (17) 1996-1997 (21) 1998-1999 (22) 2000-2001 (35) 2002 (15) 2003 (32) 2004 (36) 2005 (28) 2006 (47) 2007 (40) 2008 (36) 2009 (38) 2010-2011 (29) 2012 (16) 2013-2014 (28) 2015-2016 (19) 2017 (18) 2018-2019 (24) 2020-2021 (23) 2022-2023 (18) 2024 (3)
Publication types (Num. hits)
article(391) incollection(10) inproceedings(231) phdthesis(8)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 376 occurrences of 215 keywords

Results
Found 640 publication records. Showing 640 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
82Jordi Castro 0001 Solving Difficult Multicommodity Problems with a Specialized Interior-Point Algorithm. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF linear programming, interior-point methods, multicommodity flows, network optimization
77Frank Thomson Leighton, Ankur Moitra Extensions and limits to vertex sparsification. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF oblivious reductions, multicommodity flow
70David Coudert, Hervé Rivano, Xavier Roche A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem. Search on Bibsonomy WAOA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF combinatorial approximation, Multicommodity flow, incremental algorithm, dynamic shortest paths
70Lisa Fleischer Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. Search on Bibsonomy FOCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF approximation algorithms, network flow, multicommodity flow
70Mustafa Ç. Pinar, Stavros A. Zenios A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF massively parallel algorithms, multicommodity network problems, parallel optimization
65Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein 0001 An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. Search on Bibsonomy IPCO The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
63Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd The all-or-nothing multicommodity flow problem. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF all-or-nothing multicommodity flow, approximation algorithms, online algorithms, multicommodity flow, oblivious routing, edge disjoint paths
58George Karakostas Faster approximation schemes for fractional multicommodity flow problems. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Multicommodity flows, fully-polynomial time approximation schemes
58Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd Multicommodity flow, well-linked terminals, and routing problems. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF all-or-nothing flow, flow-cut gaps, network routing, multicommodity flow, disjoint paths
58Margarida Moz, Margarida Vaz Pato Solving the Problem of Rerostering Nurse Schedules with Hard Constraints: New Multicommodity Flow Models. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF rerostering, integer multicommodity flow problems, binary linear programming, nurse scheduling
58Hongxia Li, Shuicheng Tian, Yuan Pan, Xiao Zhang, Xiaochen Yu Minimum-Cost Optimization in Multicommodity Logistic Chain Network. Search on Bibsonomy IWMM/GIAE The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Transportation Network Management, Maximal-Flow Algorithm, Minimum-Cost Optimization, Multicommodity Flow, Network Operations
58Margarida Moz, Margarida Vaz Pato An Integer Multicommodity Flow Model Applied to the Rerostering of Nurse Schedules. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF employee scheduling, rerostering, integer multicommodity flow problems, integer linear programming
58Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd Multicommodity Demand Flow in a Tree. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF integer multicommodity flow, packing integer program, approximation algorithm, tree, integrality gap
53Toshinori Yamada, Kazuhiro Karasawa On Finding a Solution in the Core of a Multicommodity Flow Game on a Spider. Search on Bibsonomy APCCAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
53Lisa Fleischer, Kamal Jain, Mohammad Mahdian Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games. Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
53Amit Kumar 0001, Anupam Gupta 0001, Tim Roughgarden A Constant-Factor Approximation Algorithm for the Multicommodity. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
53Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd A Note on Multiflows and Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Product multicommodity flow, Treewidth, Edge-disjoint paths
48Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman Single source multiroute flows and cuts on uniform capacity networks. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
48Matthew Andrews, Kyomin Jung, Alexander L. Stolyar Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF scheduling, routing, stability
46Aleksander Madry Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF dynamic graph algorithms, multicommodity flow problems
46Tobias Harks, Stefan Heinz 0001, Marc E. Pfetsch Competitive Online Multicommodity Routing. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Online network optimization, Multicommodity routing, Competitive analysis, Unsplittable flow
46Luyi Gui, Özlem Ergun Dual Payoffs, Core and a Collaboration Mechanism Based on Capacity Exchange Prices in Multicommodity Flow Games. Search on Bibsonomy WINE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Multicommodity Flow Game, Dual Payoffs, Exchange Prices, Mechanism Design, Core
46Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd Multicommodity demand flow in a tree and packing integer programs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Integer multicommodity flow, packing integer program, approximation algorithm, tree, integrality gap
46Cüneyt F. Bazlamaçci, Fatih Say Minimum concave cost multicommodity network design. Search on Bibsonomy Telecommun. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Concave cost network design, Circuit switching and packet switching network design, Multicommodity flow problem
46Kumar Padmanabh, Rajarshi Roy 0001 Multicommodity Flow Based Maximum Lifetime Routing in Wireless Sensor Network. Search on Bibsonomy ICPADS (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Multicommodity Flow Maximum Lifetime routing, Wireless Sensor Network, Routing Protocol
46Moses Charikar, Adriana Karagiozova On non-uniform multicommodity buy-at-bulk network design. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF buy-at-bulk, multicommodity, approximation algorithms, network design, non-uniform
46Ilfat Ghamlouche, Teodor Gabriel Crainic, Michel Gendreau Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF fixed-charge capacitated multicommodity network design, cycle-based neighbourhoods, tabu search, meta-heuristics, path relinking
46Nadia Cobos Zaleta, Ada Margarita Alvarez Socarrás Tabu Search-based algorithm for Capacitated Multicommodity Network Design Problem. Search on Bibsonomy CONIELECOMP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF multicommodity networks, Tabu Search, network design
46Bernard Gendron, Jean-Yves Potvin, Patrick Soriano A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF multicommodity capacitated location with balancing requirements, slope scaling, tabu search
41Elona Erez, Meir Feder Improving the multicommodity flow rates with network codes for two sources. Search on Bibsonomy IEEE J. Sel. Areas Commun. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
41Yi-Kuei Lin System Reliability of a Limited-Flow Network in Multicommodity Case. Search on Bibsonomy IEEE Trans. Reliab. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
41Baruch Awerbuch, Rohit Khandekar Distributed network monitoring and multicommodity flows: a primal-dual approach. Search on Bibsonomy PODC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF passive network measurement, distributed algorithms, multi-commodity flows
41Rudolf Fleischer, Jian Li 0015, Shijun Tian, Hong Zhu 0004 Non-metric Multicommodity and Multilevel Facility Location. Search on Bibsonomy AAIM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
41R. Ravi 0001, Amitabh Sinha Multicommodity facility location. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
41Gábor Rétvári, József Bíró, Tibor Cinkler A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering. Search on Bibsonomy ISCC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
41Ying Du, Danny Z. Chen, Xiaodong Wu 0001 Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study. Search on Bibsonomy COCOON The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
41Meinolf Sellmann, Norbert Sensen, Larissa Timajev Multicommodity Flow Approximation Used for Exact Graph Partitioning. Search on Bibsonomy ESA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
41Lisa Fleischer, Martin Skutella The Quickest Multicommodity Flow Problem. Search on Bibsonomy IPCO The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
41George Karakostas Faster approximation schemes for fractional multicommodity flow problems. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  BibTeX  RDF
41Michel Minoux Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
41Norbert Sensen Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows. Search on Bibsonomy ESA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
41Jordi Castro 0001, Antonio Frangioni A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows. Search on Bibsonomy VECPAR The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
41Naveen Garg 0001, Jochen Könemann Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. Search on Bibsonomy FOCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
41Hiroshi Hirai 0001 The maximum multiflow problems with bounded fractionality. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF metrics, polynomial time algorithms, multicommodity flows
41Guy Kortsarz, Zeev Nutov Approximating Some Network Design Problems with Node Costs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation
41Tom Coenen, Maurits de Graaf, Richard J. Boucherie An Upper Bound on Multi-hop Wireless Network Performance. Search on Bibsonomy ITC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF cut condition, interference, Wireless multi-hop network, multicommodity flow problem
41Julia Chuzhoy, Sanjeev Khanna Polynomial flow-cut gaps and hardness of directed cut problems. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF concurrent flow, directed multicut, directed sparsest cut, flow-cut gaps, hardness of approximation, multicommodity flow
41Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman On the capacity of information networks. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF infomational dominance, k-pairs communication problems, multiple unicast sessions, capacity, network coding, multicommodity flow, sparsity
41Sanjeet Singh, Pankaj Gupta, Davinder Bhatia On Multiparametric Sensitivity Analysis in Minimum Cost Network Flow Problem. Search on Bibsonomy ICCSA (4) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF multicommodity minimum cost network flow, multiparametric sensitivity analysis, tolerance approach, parametric analysis, Minimum cost network flow
41Jordi Castro 0001 Network Flows Heuristics for Complementary Cell Suppression: An Empirical Evaluation and Extensions. Search on Bibsonomy Inference Control in Statistical Databases The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Complementary cell suppression problem, network flows with side constraints, multicommodity network flows, linear programming, network optimization
36Richard Cole 0001, Yevgeniy Dodis, Tim Roughgarden Bottleneck links, variable demand, and the tragedy of the commons. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
36C. D. Randazzo, Henrique Pacca Loureiro Luna A Comparison of Optimal Methods for Local Access Uncapacitated Network Design. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF branch-and-bound, network design, branch-and-cut, Benders decomposition
36Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky Practical Approximation Algorithms for Separable Packing Linear Programs. Search on Bibsonomy WADS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
36Robert C. Carden IV, Jianmin Li, Chung-Kuan Cheng A global router with a theoretical bound on the optimal solution. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
34Richard D. Wollmer Multicommodity networks with resource constraints: The generalized multicommodity flow problem. Search on Bibsonomy Networks The full citation details ... 1971 DBLP  DOI  BibTeX  RDF
34Pierre Chardaire, Abdel Lisser Nonoriented Multicommodity Flow Problems. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Network, Multicommodity flow, Decomposition algorithms
34Cynthia Barnhart, Niranjan Krishnan, Pamela H. Vance Multicommodity Flow Problems. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Multicommodity network flows, Decomposition, Transportation, Column generation
34Mohamad K. Hasan Multimodal, multicommodity international freight simultaneous transportation network equilibrium model. Search on Bibsonomy Telecommun. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF International multimodal multicommodity network, Simultaneous transportation network equilibrium model, Integrated transport network, Integrated transport system, Globalization and regional integration, International freight transport, Importers, Exporters
34Ankur Moitra Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF metric geometry, approximation algorithms, multicommodity flow
34James Broberg, Zhen Liu 0001, Cathy H. Xia, Li Zhang 0002 A multicommodity flow model for distributed stream processing. Search on Bibsonomy SIGMETRICS/Performance The full citation details ... 2006 DBLP  DOI  BibTeX  RDF distributed algorithms, stream processing, multicommodity flow, potential function
34Teodor Gabriel Crainic, Bernard Gendron, Geneviève Hernu A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design. Search on Bibsonomy J. Heuristics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF slope scaling, Lagrangean heuristic, multicommodity capacitated fixed-charge network design, long-term memory
34Garng M. Huang, Shan Zhu A fast distributed optimal routing algorithm for multicommodity large data networks. Search on Bibsonomy IPPS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF fast distributed optimal routing algorithm, multicommodity large data networks, large data network, multicommodities, parallel time complexity, flow demand, OPNET simulation tool, computational complexity, distributed algorithms
34Baruch Awerbuch, Frank Thomson Leighton A Simple Local-Control Approximation Algorithm for Multicommodity Flow Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF DIMACS generator, local-control approximation algorithm, polynomial time flow algorithms, centralized decision making, distributed network, multicommodity flow
34Philip N. Klein, Ajit Agrawal, R. Ravi 0001, Satish Rao Approximation through Multicommodity Flow Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF minimum deletion, max-flow-min-cut theorem, approximation algorithms, multicommodity flow
34Frank Thomson Leighton, Satish Rao An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms Search on Bibsonomy FOCS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF max-flow min-cut theorem, minimum quotient separators, 1/3-2/3 separators, VLSI layout area, approximation algorithms, distributed networks, bifurcators, crossing number, multicommodity flow problems, optimal approximation
29George Karakostas, Stavros G. Kolliopoulos Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Taxes, Elastic demand, Price of anarchy, Traffic equilibrium
29George Karakostas, Stavros G. Kolliopoulos Stackelberg Strategies for Selfish Routing in General Multicommodity Networks. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Stackelberg strategies, Price of anarchy, Selfish routing
29Frédéric Babonneau, Jean-Philippe Vial ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems. Search on Bibsonomy Math. Program. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) Nondifferentiable optimization, Network flow problem
29Ritesh Madan, Devavrat Shah, Olivier Lévêque Product Multicommodity Flow in Wireless Networks. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
29Jochen Könemann, Ojas Parekh, David Pritchard Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. Search on Bibsonomy WAOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
29DongMei Xing Nonmetric Multicommodity Facility Location and K-Median Problem with Service Installation Costs. Search on Bibsonomy CSSE (3) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
29Alex Fridman 0001, Steven Weber 0001, Kapil R. Dandekar, Moshe Kam Cross-layer multicommodity capacity expansion on ad hoc wireless networks of cognitive radios. Search on Bibsonomy CISS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
29Luca Becchetti, Jochen Könemann, Stefano Leonardi 0001, Martin Pál Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Steiner forests, Approximation algorithms, network design, cost sharing
29Alexander Hall, Katharina Langkau, Martin Skutella An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
29Baruch Awerbuch, Rohit Khandekar, Satish Rao Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
29João F. M. Sarubbi, Geraldo Robson Mateus, Henrique Pacca Loureiro Luna, Gilberto de Miranda Jr. Model and algorithms for the Multicommodity Traveling Salesman Problem. Search on Bibsonomy HIS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
29Tobias Harks, Stefan Heinz 0001, Marc E. Pfetsch Competitive Online Multicommodity Routing. Search on Bibsonomy WAOA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
29George Karakostas, Stavros G. Kolliopoulos Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. Search on Bibsonomy COCOON The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
29Ada M. Alvarez, José Luis González Velarde, Karim De-Alba Grasp Embedded Scatter Search for the Multicommodity Capacitated Network Design Problem. Search on Bibsonomy J. Heuristics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Scater Search, network design, GRASP
29Luca Becchetti, Jochen Könemann, Stefano Leonardi 0001, Martin Pál Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
29Garima Batra, Naveen Garg 0001, Garima Gupta Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
29George Karakostas, Stavros G. Kolliopoulos Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users. Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
29Krzysztof Walkowiak On Application of Ant Algorithms to Non-bifurcated Multicommodity Flow Problem. Search on Bibsonomy ICAISC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
29Anupam Gupta 0001, Amit Kumar 0001, Martin Pál, Tim Roughgarden Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. Search on Bibsonomy FOCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
29Alexander Hall, Steffen Hippler, Martin Skutella Multicommodity Flows over Time: Efficient Algorithms and Complexity. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF flow over time, dynamic flow, routing, complexity, network flow, efficient algorithm
29Evangelos Markakis, Amin Saberi On the core of the multicommodity flow game. Search on Bibsonomy EC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF duality, core, cooperative games
29Alexander Hall, Katharina Langkau, Martin Skutella An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
29Oktay Günlük A New Min-Cut Max-Flow Ratio for Multicommodity Flows. Search on Bibsonomy IPCO The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
29Susanne Albers, Carsten Witt Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
29S. Muthukrishnan 0001, Torsten Suel Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. Search on Bibsonomy RANDOM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
29Karsten Weihe Multicommodity Flows in Even, Planar Networks. Search on Bibsonomy ISAAC The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
29George Tsaggouris, Christos D. Zaroliagis Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Multiobjective shortes path, Non-linear objectives, Multiple constrained (optimal) path, Non-additive shortest path, Qos-aware multicommodity flow, Multiobjective optimization, FPTAS
29Peng-Jun Wan Multiflows in multihop wireless networks. Search on Bibsonomy MobiHoc The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithms, multicommodity flow, capacity region
29Ángel Marín, Esteve Codina Network design: taxi planning. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Aircraft routing and scheduling, Taxi planning, Airport management, Binary capacitated multicommodity flow network, Branch and Bound
29Massimiliano Caramia, Antonino Sgalambro An exact approach for the maximum concurrent k -splittable flow problem. Search on Bibsonomy Optim. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF k-splittable flow, Multicommodity, Throughput, Branch and bound, Mixed integer programming
29André Schumacher, Harri Haanpää Distributed network utility maximization in wireless networks with a bounded number of paths. Search on Bibsonomy PM2HW2N The full citation details ... 2008 DBLP  DOI  BibTeX  RDF dual decomposition, congestion control, multipath routing, multicommodity flow, proportional fairness
29Chandra Chekuri, Sanjeev Khanna Edge-disjoint paths revisited. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF multicommodity flow relaxation, approximation algorithm, greedy algorithm, Edge-disjoint paths
29Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar Hardness of routing with congestion in directed graphs. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF all-or-nothing flow, hardness of approximation, multicommodity flow, edge-disjoint paths, integrality gap, congestion minimization
29Ángel Marín Airport management: taxi planning. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Aircraft routing and scheduling, Taxi Planning, Airport management, Binary capacitated multicommodity flow network, Fix and Relax, Branch and Bound
29Christina Fragouli, Tarik Tabet On conditions for constant throughput in wireless networks. Search on Bibsonomy ACM Trans. Sens. Networks The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Foundations of sensor and ad hoc networks, constant throughput, min cut bounds, sensor networks throughput, mobility, wireless networks, mobility model, multicommodity flow
Displaying result #1 - #100 of 640 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license