Faster Parametric Shortest Path And Minimum Balance Algorithms

Neal E Young

The book Faster Parametric Shortest Path And Minimum Balance Algorithms was written by author Neal E Young Here you can read free online of Faster Parametric Shortest Path And Minimum Balance Algorithms book, rate and share your impressions in comments. If you don't know what to write, just answer the question: Why is Faster Parametric Shortest Path And Minimum Balance Algorithms a good or bad book?

8/10 (3 votes)

/10 Rate

8/10
3

/10
Your: Rate

Where can I read Faster Parametric Shortest Path And Minimum Balance Algorithms for free?
In our eReader you can find the full English version of the book. Read Faster Parametric Shortest Path And Minimum Balance Algorithms Online - link to read the book on full screen. Our eReader also allows you to upload and read Pdf, Txt, ePub and fb2 books. In the Mini eReder on the page below you can quickly view all pages of the book - Read Book Faster Parametric Shortest Path And Minimum Balance Algorithms

What reading level is Faster Parametric Shortest Path And Minimum Balance Algorithms book?
To quickly assess the difficulty of the text, read a short excerpt:

Fredman and R. E. Tarjan, "Fibonacci heaps and their uses in improved network optimization algorithms", J. Assoc. Comput. Macb. 34 (1987), 596-615.
[GT89] A. V. Goldberg and R. E. Tarjan, "Finding minimum-cost circulations by canceling negative cycles", J. Assoc. Comput. Mach. 36 (1989), to appear.
[G085] S. C. Graves and J. B Orlin, "A minimum concave cost dynamic net- work flow problem, with an application to lot-sizing", Networks 15 (1985), 59-71.
[Kar78] R. M Karp, "A characterization of th...e minimum cycle mean in a di- graph", Discrete Mathematics 23 (1978), 309-311.
[K081] R. M. Karp and J. B. Orlin, "Parametric shortest paths with an appli- cation to cyclic staffing, " Discrete Applied Mathematics 3 (1981), 37-45.
[OR85] J. B. Orlin and U. G. Rothblum, "Computing optimal scalings by para- metric network algorithms", Mathematical Programming 32 (1985), 1-10.
[Sch89] N. Schlenker, personal communication, Department of Computer Sci- ence, Princeton University, Princeton, NJ, 1989.
[SS87] H.

What to read after Faster Parametric Shortest Path And Minimum Balance Algorithms?
You can find similar books in the "Read Also" column, or choose other free books by Neal E Young to read onlineMoreLess Show More Show Less

Download