R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network flows: theory, algorithms and applications. Englewood Cli#s: Prentice Hall, New Jersey, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Timetabling Problems at the TU Eindhoven - John Van Den (Correct)
No context found.
R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network flows: theory, algorithms and applications. Englewood Cli#s: Prentice Hall, New Jersey, 1993.
Routing demands with time-varying bandwidth profiles on a.. - Ricciato, Monaco (2005) (1 citation) (Correct)
No context found.
J.B. Orlin, R.K. Ahuja, T.L. Magnanti, Network Flows: Theory, Algorithm and Applications, Prentice Hall, Englewood Cli#s, NJ, 1993.
The Demand Matching Problem - Shepherd, Vetta (2002) (Correct)
No context found.
R. Ahuja, T. Magnanti and J. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice Hall, 1993.
GCC-like Restrictions on the Same Constraint - Beldiceanu, Katriel, Thiel (Correct)
No context found.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows : theory, algorithms and applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
Stochastic Algorithms for Design of Thrifty.. - Cinkler, Henk, Gordos (2000) (2 citations) (Correct)
No context found.
R.K. Ahuya, T.L. Magnanti, J.B. Orlin, \Network Flows: Theory, Algorithms and Applications", 1993, Prentice Hall, ISBN 0-13-617549-x
Global Optimization Using Embedded Graphs - Ishikawa (2000) (8 citations) (Correct)
No context found.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms and Applications. 133--165, Prentice Hall. NJ, U.S.A. 1993.
On the Capacity of Network Coding for Random Networks - Ramamoorthy, Shi, Wesel (2003) (Correct)
No context found.
R. K. Ahuja, T. L. Maganti, and J. B. Orlin, Network Flows:Theory, Algorithms and Applications, Prentice-Hall, 1993.
Quality of Service Provisioning through Traffic.. - Trimintzios.. (2003) (1 citation) (Correct)
No context found.
R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ, 1993.
Algorithm Engineering - Demetrescu, Finocchi, Italiano (2003) (Correct)
No context found.
R.K. Ahuia, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cli s, NJ, 1993.
Management of End-to-end Quality of Service - Across The Internet (Correct)
No context found.
R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice Hall, 1993
Connectivity, Performance, and Resiliency of IP-Based CDMA.. - Bu, Chan, Ramjee (2004) (Correct)
No context found.
R. A. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms and Application, Prentice Hall, 1993.
Connectivity, Performance, and Resiliency of IP-Based CDMA.. - Bu, Chan, Ramjee (2004) (Correct)
No context found.
R. A. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms and Application, Prentice Hall, 1993.
Dissimilarity Measure for Collections of Objects - And Values Petko (Correct)
No context found.
R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice Hall, 1993.
The Vertex Set of a 0/1-Polytope is Strongly P-Enumerable - Bussieck, Lübbecke (Correct)
No context found.
R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows | Theory, Algorithms and Applications. Prentice-Hall, Inc., Englewood Cli s, New Jersey 07632, 1993.
A Robust Distributed Generalized Matching Protocol .. - Goddard.. (2003) (Correct)
No context found.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, 1994.
Algorithm Engineering - Demetrescu, Finocchi, Italiano (2003) (Correct)
No context found.
R.K. Ahuia, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cli#s, NJ, 1993.
Experimental Evaluation of Approximation Algorithms for.. - Kolliopoulos, Stein (1999) (Correct)
No context found.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: Theory, Algorithms and Applications. Prentice Hall, 1993.
Approximation Algorithms for Single-Source Unsplittable Flow - Kolliopoulos, Stein (1997) (2 citations) (Correct)
No context found.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network ows: Theory, Algorithms and Applications, Prentice Hall, 1993.
An Exact Algorithm for the Robust Shortest Path Problem - With Interval Data (Correct)
No context found.
R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, 1993.
Network Flow Techniques for Dynamic Voltage Scaling in.. - Swaminathan, Chakrabarty (2004) (Correct)
No context found.
R. K. Ahuja, T. L. Magnanti and J. B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs, NJ, 1993.
Directed Single-Source Shortest-Paths in Linear Average-Case Time - Meyer (2001) (Correct)
No context found.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows : Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
Exact and Approximation Algorithms for Network Flow and.. - Kolliopoulos (1998) (2 citations) (Correct)
No context found.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: Theory, Algorithms and Applications. Prentice Hall, 1993.
On Uniform K-Partition Problems - Dell'Olmo, Hansen, Pallottino.. (2003) (Correct)
No context found.
R. K. Ahuja, T. L. Magnanti, J. B. Orlin. Network Flows: theory,algorithms and applications, Prentice Hall, 1993.
Network Protocol for Interaction and Scalable.. - Jan-Michael Frahm.. (2002) (Correct)
No context found.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms and Application. Prentice Hall, February 1993.
Buffer Overrun Detection Using Linear Programming.. - Ganapathy, Jha.. (2003) (3 citations) (Correct)
No context found.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, 1993.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC