Optimizing in Graphs with Expensive Computation of Edge Weights

Frank Noé (noe@math.fu-berlin.de), Marcus Oswald and Gerhard Reinelt
Additional contact information
Frank Noé: FU Berlin
Marcus Oswald: University of Heidelberg
Gerhard Reinelt: University of Heidelberg

A chapter in Operations Research Proceedings 2007, 2008, pp 435-440 from Springer

Abstract: Abstract Much research has gone into the development of fast graph optimization algorithms and many problems, such as shortest-path [1] or minimum-cut

Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-77903-2_67

Ordering information: This item can be ordered from
http://www.springer.com/9783540779032

DOI: 10.1007/978-3-540-77903-2_67

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla (sonal.shukla@springer.com) and Springer Nature Abstracting and Indexing (indexing@springernature.com).