|
|
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 |
82 | Jordi Castro 0001 |
Solving Difficult Multicommodity Problems with a Specialized Interior-Point Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 124(1-4), pp. 35-48, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
linear programming, interior-point methods, multicommodity flows, network optimization |
77 | Frank Thomson Leighton, Ankur Moitra |
Extensions and limits to vertex sparsification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 47-56, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
oblivious reductions, multicommodity flow |
70 | David Coudert, Hervé Rivano, Xavier Roche |
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers, pp. 256-259, 2003, Springer, 3-540-21079-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
combinatorial approximation, Multicommodity flow, incremental algorithm, dynamic shortest paths |
70 | Lisa Fleischer |
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 24-31, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
approximation algorithms, network flow, multicommodity flow |
70 | Mustafa Ç. Pinar, Stavros A. Zenios |
A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 20(4), pp. 531-552, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
massively parallel algorithms, multicommodity network problems, parallel optimization |
65 | Andrew 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](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings, pp. 338-352, 1998, Springer, 3-540-64590-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
63 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
The all-or-nothing multicommodity flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 156-165, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
all-or-nothing multicommodity flow, approximation algorithms, online algorithms, multicommodity flow, oblivious routing, edge disjoint paths |
58 | George Karakostas |
Faster approximation schemes for fractional multicommodity flow problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(1), pp. 13:1-13:17, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Multicommodity flows, fully-polynomial time approximation schemes |
58 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Multicommodity flow, well-linked terminals, and routing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 183-192, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
all-or-nothing flow, flow-cut gaps, network routing, multicommodity flow, disjoint paths |
58 | Margarida Moz, Margarida Vaz Pato |
Solving the Problem of Rerostering Nurse Schedules with Hard Constraints: New Multicommodity Flow Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 128(1-4), pp. 179-197, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
rerostering, integer multicommodity flow problems, binary linear programming, nurse scheduling |
58 | Hongxia Li, Shuicheng Tian, Yuan Pan, Xiao Zhang, Xiaochen Yu |
Minimum-Cost Optimization in Multicommodity Logistic Chain Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWMM/GIAE ![In: Computer Algebra and Geometric Algebra with Applications, 6th International Workshop, IWMM 2004, Shanghai, China, May 19-21, 2004, and International Workshop, GIAE 2004, Xian, China, May 24-28, 2004, Revised Selected Papers, pp. 97-104, 2004, Springer, 3-540-26296-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Transportation Network Management, Maximal-Flow Algorithm, Minimum-Cost Optimization, Multicommodity Flow, Network Operations |
58 | Margarida Moz, Margarida Vaz Pato |
An Integer Multicommodity Flow Model Applied to the Rerostering of Nurse Schedules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 119(1-4), pp. 285-301, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
employee scheduling, rerostering, integer multicommodity flow problems, integer linear programming |
58 | Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd |
Multicommodity Demand Flow in a Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 410-425, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
integer multicommodity flow, packing integer program, approximation algorithm, tree, integrality gap |
53 | Toshinori Yamada, Kazuhiro Karasawa |
On Finding a Solution in the Core of a Multicommodity Flow Game on a Spider. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APCCAS ![In: IEEE Asia Pacific Conference on Circuits and Systems 2006, APCCAS 2006, Singapore, 4-7 December 2006, pp. 1011-1014, 2006, IEEE, 1-4244-0387-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
53 | Lisa Fleischer, Kamal Jain, Mohammad Mahdian |
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 277-285, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
53 | Amit Kumar 0001, Anupam Gupta 0001, Tim Roughgarden |
A Constant-Factor Approximation Algorithm for the Multicommodity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 333-, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
53 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
A Note on Multiflows and Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(3), pp. 400-412, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Product multicommodity flow, Treewidth, Edge-disjoint paths |
48 | Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman |
Single source multiroute flows and cuts on uniform capacity networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 855-863, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
48 | Matthew 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](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 145-154, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
scheduling, routing, stability |
46 | Aleksander Madry |
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 121-130, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
dynamic graph algorithms, multicommodity flow problems |
46 | Tobias Harks, Stefan Heinz 0001, Marc E. Pfetsch |
Competitive Online Multicommodity Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(3), pp. 533-554, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Online network optimization, Multicommodity routing, Competitive analysis, Unsplittable flow |
46 | Luyi Gui, Özlem Ergun |
Dual Payoffs, Core and a Collaboration Mechanism Based on Capacity Exchange Prices in Multicommodity Flow Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings, pp. 61-69, 2008, Springer, 978-3-540-92184-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Multicommodity Flow Game, Dual Payoffs, Exchange Prices, Mechanism Design, Core |
46 | Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd |
Multicommodity demand flow in a tree and packing integer programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(3), pp. 27, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Integer multicommodity flow, packing integer program, approximation algorithm, tree, integrality gap |
46 | Cüneyt F. Bazlamaçci, Fatih Say |
Minimum concave cost multicommodity network design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Telecommun. Syst. ![In: Telecommun. Syst. 36(4), pp. 181-203, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Concave cost network design, Circuit switching and packet switching network design, Multicommodity flow problem |
46 | Kumar Padmanabh, Rajarshi Roy 0001 |
Multicommodity Flow Based Maximum Lifetime Routing in Wireless Sensor Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS (1) ![In: 12th International Conference on Parallel and Distributed Systems, ICPADS 2006, Minneapolis, Minnesota, USA, July 12-15, 2006, pp. 187-194, 2006, IEEE Computer Society, 0-7695-2612-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Multicommodity Flow Maximum Lifetime routing, Wireless Sensor Network, Routing Protocol |
46 | Moses Charikar, Adriana Karagiozova |
On non-uniform multicommodity buy-at-bulk network design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 176-182, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
buy-at-bulk, multicommodity, approximation algorithms, network design, non-uniform |
46 | Ilfat Ghamlouche, Teodor Gabriel Crainic, Michel Gendreau |
Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 131(1-4), pp. 109-133, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
fixed-charge capacitated multicommodity network design, cycle-based neighbourhoods, tabu search, meta-heuristics, path relinking |
46 | Nadia Cobos Zaleta, Ada Margarita Alvarez Socarrás |
Tabu Search-based algorithm for Capacitated Multicommodity Network Design Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONIELECOMP ![In: 14th International Conference on Electronics, Communications, and Computers (CONIELECOMP 2004), 16-18 February 2004, Veracruz, Mexico, pp. 144-148, 2004, IEEE Computer Society, 0-7695-2074-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
multicommodity networks, Tabu Search, network design |
46 | Bernard Gendron, Jean-Yves Potvin, Patrick Soriano |
A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 122(1-4), pp. 193-217, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
multicommodity capacitated location with balancing requirements, slope scaling, tabu search |
41 | Elona Erez, Meir Feder |
Improving the multicommodity flow rates with network codes for two sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 27(5), pp. 814-824, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
41 | Yi-Kuei Lin |
System Reliability of a Limited-Flow Network in Multicommodity Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Reliab. ![In: IEEE Trans. Reliab. 56(1), pp. 17-25, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
41 | Baruch Awerbuch, Rohit Khandekar |
Distributed network monitoring and multicommodity flows: a primal-dual approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, pp. 284-291, 2007, ACM, 978-1-59593-616-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
passive network measurement, distributed algorithms, multi-commodity flows |
41 | Rudolf Fleischer, Jian Li 0015, Shijun Tian, Hong Zhu 0004 |
Non-metric Multicommodity and Multilevel Facility Location. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006, Proceedings, pp. 138-148, 2006, Springer, 3-540-35157-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
41 | R. Ravi 0001, Amitabh Sinha |
Multicommodity facility location. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 342-349, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
41 | Gá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](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the 9th IEEE Symposium on Computers and Communications (ISCC 2006), June 28 - July 1, 2004, Alexandria, Egypt, pp. 957-962, 2004, IEEE Computer Society, 0-7803-8623-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
41 | Ying Du, Danny Z. Chen, Xiaodong Wu 0001 |
Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings, pp. 112-121, 2004, Springer, 3-540-22856-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
41 | Meinolf Sellmann, Norbert Sensen, Larissa Timajev |
Multicommodity Flow Approximation Used for Exact Graph Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, pp. 752-764, 2003, Springer, 3-540-20064-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
41 | Lisa Fleischer, Martin Skutella |
The Quickest Multicommodity Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 36-53, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
41 | George Karakostas |
Faster approximation schemes for fractional multicommodity flow problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 166-173, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
41 | Michel Minoux |
Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 106(1-4), pp. 19-46, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
41 | Norbert Sensen |
Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 391-403, 2001, Springer, 3-540-42493-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
41 | Jordi Castro 0001, Antonio Frangioni |
A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VECPAR ![In: Vector and Parallel Processing - VECPAR 2000, 4th International Conference, Porto, Portugal, June 21-23, 2000, Selected Papers and Invited Talks, pp. 301-315, 2000, Springer, 3-540-41999-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
41 | Naveen Garg 0001, Jochen Könemann |
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 300-309, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
41 | Hiroshi Hirai 0001 |
The maximum multiflow problems with bounded fractionality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 115-120, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
metrics, polynomial time algorithms, multicommodity flows |
41 | Guy Kortsarz, Zeev Nutov |
Approximating Some Network Design Problems with Node Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 231-243, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation |
41 | Tom Coenen, Maurits de Graaf, Richard J. Boucherie |
An Upper Bound on Multi-hop Wireless Network Performance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITC ![In: Managing Traffic Performance in Converged Networks, 20th International Teletraffic Congress, ITC20 2007, Ottawa, Canada, June 17-21, 2007, Proceedings, pp. 335-347, 2007, Springer, 978-3-540-72989-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
cut condition, interference, Wireless multi-hop network, multicommodity flow problem |
41 | Julia Chuzhoy, Sanjeev Khanna |
Polynomial flow-cut gaps and hardness of directed cut problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 179-188, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
concurrent flow, directed multicut, directed sparsest cut, flow-cut gaps, hardness of approximation, multicommodity flow |
41 | Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman |
On the capacity of information networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2345-2364, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
infomational dominance, k-pairs communication problems, multiple unicast sessions, capacity, network coding, multicommodity flow, sparsity |
41 | Sanjeet Singh, Pankaj Gupta, Davinder Bhatia |
On Multiparametric Sensitivity Analysis in Minimum Cost Network Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (4) ![In: Computational Science and Its Applications - ICCSA 2005, International Conference, Singapore, May 9-12, 2005, Proceedings, Part IV, pp. 1190-1202, 2005, Springer, 3-540-25863-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
multicommodity minimum cost network flow, multiparametric sensitivity analysis, tolerance approach, parametric analysis, Minimum cost network flow |
41 | Jordi Castro 0001 |
Network Flows Heuristics for Complementary Cell Suppression: An Empirical Evaluation and Extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inference Control in Statistical Databases ![In: Inference Control in Statistical Databases, From Theory to Practice, pp. 59-73, 2002, Springer, 3-540-43614-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Complementary cell suppression problem, network flows with side constraints, multicommodity network flows, linear programming, network optimization |
36 | Richard Cole 0001, Yevgeniy Dodis, Tim Roughgarden |
Bottleneck links, variable demand, and the tragedy of the commons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 668-677, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | C. D. Randazzo, Henrique Pacca Loureiro Luna |
A Comparison of Optimal Methods for Local Access Uncapacitated Network Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 106(1-4), pp. 263-286, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
branch-and-bound, network design, branch-and-cut, Benders decomposition |
36 | Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky |
Practical Approximation Algorithms for Separable Packing Linear Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings, pp. 325-337, 2001, Springer, 3-540-42423-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Robert C. Carden IV, Jianmin Li, Chung-Kuan Cheng |
A global router with a theoretical bound on the optimal solution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(2), pp. 208-216, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
34 | Richard D. Wollmer |
Multicommodity networks with resource constraints: The generalized multicommodity flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 1(3), pp. 245-263, 1971. The full citation details ...](Pics/full.jpeg) |
1971 |
DBLP DOI BibTeX RDF |
|
34 | Pierre Chardaire, Abdel Lisser |
Nonoriented Multicommodity Flow Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 2647-2651, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Network, Multicommodity flow, Decomposition algorithms |
34 | Cynthia Barnhart, Niranjan Krishnan, Pamela H. Vance |
Multicommodity Flow Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 2354-2362, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Multicommodity network flows, Decomposition, Transportation, Column generation |
34 | Mohamad K. Hasan |
Multimodal, multicommodity international freight simultaneous transportation network equilibrium model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Telecommun. Syst. ![In: Telecommun. Syst. 40(1-2), pp. 39-54, 2009. The full citation details ...](Pics/full.jpeg) |
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 |
34 | Ankur Moitra |
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 3-12, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
metric geometry, approximation algorithms, multicommodity flow |
34 | James Broberg, Zhen Liu 0001, Cathy H. Xia, Li Zhang 0002 |
A multicommodity flow model for distributed stream processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS/Performance ![In: Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS/Performance 2006, Saint Malo, France, June 26-30, 2006, pp. 377-378, 2006, ACM, 1-59593-319-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
distributed algorithms, stream processing, multicommodity flow, potential function |
34 | Teodor 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](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 10(5), pp. 525-545, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
slope scaling, Lagrangean heuristic, multicommodity capacitated fixed-charge network design, long-term memory |
34 | Garng M. Huang, Shan Zhu |
A fast distributed optimal routing algorithm for multicommodity large data networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 551-555, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
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 |
34 | Baruch Awerbuch, Frank Thomson Leighton |
A Simple Local-Control Approximation Algorithm for Multicommodity Flow ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 459-468, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
DIMACS generator, local-control approximation algorithm, polynomial time flow algorithms, centralized decision making, distributed network, multicommodity flow |
34 | Philip N. Klein, Ajit Agrawal, R. Ravi 0001, Satish Rao |
Approximation through Multicommodity Flow ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 726-737, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
minimum deletion, max-flow-min-cut theorem, approximation algorithms, multicommodity flow |
34 | Frank Thomson Leighton, Satish Rao |
An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 422-431, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
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 |
29 | George Karakostas, Stavros G. Kolliopoulos |
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(2), pp. 225-249, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Taxes, Elastic demand, Price of anarchy, Traffic equilibrium |
29 | George Karakostas, Stavros G. Kolliopoulos |
Stackelberg Strategies for Selfish Routing in General Multicommodity Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(1), pp. 132-153, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Stackelberg strategies, Price of anarchy, Selfish routing |
29 | Fré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](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 120(1), pp. 179-210, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) Nondifferentiable optimization, Network flow problem |
29 | Ritesh Madan, Devavrat Shah, Olivier Lévêque |
Product Multicommodity Flow in Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(4), pp. 1460-1476, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Jochen Könemann, Ojas Parekh, David Pritchard |
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers, pp. 1-14, 2008, Springer, 978-3-540-93979-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | DongMei Xing |
Nonmetric Multicommodity Facility Location and K-Median Problem with Service Installation Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSSE (3) ![In: International Conference on Computer Science and Software Engineering, CSSE 2008, Volume 3: Grid Computing / Distributed and Parallel Computing / Information Security, December 12-14, 2008, Wuhan, China, pp. 264-269, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Alex 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](Pics/bibsonomy.png) |
CISS ![In: 42nd Annual Conference on Information Sciences and Systems, CISS 2008, Princeton, NJ, USA, 19-21 March 2008, pp. 676-680, 2008, IEEE, 978-1-4244-2246-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Luca 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](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(2), pp. 23, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Steiner forests, Approximation algorithms, network design, cost sharing |
29 | Alexander Hall, Katharina Langkau, Martin Skutella |
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 47(3), pp. 299-321, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Baruch Awerbuch, Rohit Khandekar, Satish Rao |
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 949-957, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
29 | Joã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](Pics/bibsonomy.png) |
HIS ![In: 7th International Conference on Hybrid Intelligent Systems, HIS 2007, Kaiserslautern, Germany, September 17-19, 2007, pp. 113-119, 2007, IEEE Computer Society, 0-7695-2946-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Tobias Harks, Stefan Heinz 0001, Marc E. Pfetsch |
Competitive Online Multicommodity Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers, pp. 240-252, 2006, Springer, 3-540-69513-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | George Karakostas, Stavros G. Kolliopoulos |
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings, pp. 23-32, 2006, Springer, 3-540-36925-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Ada M. Alvarez, José Luis González Velarde, Karim De-Alba |
Grasp Embedded Scatter Search for the Multicommodity Capacitated Network Design Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 11(3), pp. 233-257, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Scater Search, network design, GRASP |
29 | Luca 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](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 375-384, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
29 | Garima Batra, Naveen Garg 0001, Garima Gupta |
Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 35-46, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | George Karakostas, Stavros G. Kolliopoulos |
Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 268-276, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Krzysztof Walkowiak |
On Application of Ant Algorithms to Non-bifurcated Multicommodity Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAISC ![In: Artificial Intelligence and Soft Computing - ICAISC 2004, 7th International Conference, Zakopane, Poland, June 7-11, 2004, Proceedings, pp. 922-927, 2004, Springer, 3-540-22123-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Anupam 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](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 606-615, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Alexander Hall, Steffen Hippler, Martin Skutella |
Multicommodity Flows over Time: Efficient Algorithms and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 397-409, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
flow over time, dynamic flow, routing, complexity, network flow, efficient algorithm |
29 | Evangelos Markakis, Amin Saberi |
On the core of the multicommodity flow game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), San Diego, California, USA, June 9-12, 2003, pp. 93-97, 2003, ACM, 1-58113-679-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
duality, core, cooperative games |
29 | Alexander Hall, Katharina Langkau, Martin Skutella |
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings, pp. 71-82, 2003, Springer, 3-540-40770-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Oktay Günlük |
A New Min-Cut Max-Flow Ratio for Multicommodity Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 54-66, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Susanne Albers, Carsten Witt |
Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings, pp. 12-23, 2001, Springer, 3-540-42470-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
29 | S. Muthukrishnan 0001, Torsten Suel |
Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998, Proceedings, pp. 369-384, 1998, Springer, 3-540-65142-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
29 | Karsten Weihe |
Multicommodity Flows in Even, Planar Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings, pp. 333-342, 1993, Springer, 3-540-57568-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
29 | George Tsaggouris, Christos D. Zaroliagis |
Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(1), pp. 162-186, 2009. The full citation details ...](Pics/full.jpeg) |
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 |
29 | Peng-Jun Wan |
Multiflows in multihop wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 10th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2009, New Orleans, LA, USA, May 18-21, 2009, pp. 85-94, 2009, ACM, 978-1-60558-531-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, multicommodity flow, capacity region |
29 | Ángel Marín, Esteve Codina |
Network design: taxi planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 157(1), pp. 135-151, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Aircraft routing and scheduling, Taxi planning, Airport management, Binary capacitated multicommodity flow network, Branch and Bound |
29 | Massimiliano Caramia, Antonino Sgalambro |
An exact approach for the maximum concurrent k -splittable flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 2(2), pp. 251-265, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
k-splittable flow, Multicommodity, Throughput, Branch and bound, Mixed integer programming |
29 | André Schumacher, Harri Haanpää |
Distributed network utility maximization in wireless networks with a bounded number of paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PM2HW2N ![In: Proceedings of the 3rd ACM Workshop on Performance Monitoring and Measurement of Heterogeneous Wireless and Wired Networks, PM2HW2N 2008, Vancouver, British Columbia, Canada, October 31, 2008, pp. 96-103, 2008, ACM, 978-1-60558-239-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
dual decomposition, congestion control, multipath routing, multicommodity flow, proportional fairness |
29 | Chandra Chekuri, Sanjeev Khanna |
Edge-disjoint paths revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 46, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
multicommodity flow relaxation, approximation algorithm, greedy algorithm, Edge-disjoint paths |
29 | Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar |
Hardness of routing with congestion in directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 165-178, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
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](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 143(1), pp. 191-202, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Aircraft routing and scheduling, Taxi Planning, Airport management, Binary capacitated multicommodity flow network, Fix and Relax, Branch and Bound |
29 | Christina Fragouli, Tarik Tabet |
On conditions for constant throughput in wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Sens. Networks ![In: ACM Trans. Sens. Networks 2(3), pp. 359-379, 2006. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|