Jünger, Michael, Rinaldi, Giovanni ORCID: 0000-0003-0148-2470 and Thienel, Stefan (2000). Practical Performance of Efficient Minimum Cut Algorithms. Algorithmica, 26 (1). pp. 172-195. Springer.

[img]
Preview
 PDF
zpr97-271.pdf - Submitted Version
Download (407kB) | Preview

Abstract

In the late eighties and early nineties, three major exciting new developments (and some ramifications) in the computation of minimum capacity cuts occurred and these developments motivated us to evaluate the old and new methods experimentally. We provide a brief overview of the most important algorithms for the minimum capacity cut problem and compare these methods both on problem instances from the literature and on problem instances originating from the solution of the traveling salesman problem by branch-and-cut.

Item Type: Journal Article
Creators:
CreatorsEmailORCIDORCID Put Code
Jünger, MichaelUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
Rinaldi, GiovanniUNSPECIFIEDorcid.org/0000-0003-0148-2470UNSPECIFIED
Thienel, StefanUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
URN: urn:nbn:de:hbz:38-547880
Journal or Publication Title: Algorithmica
Volume: 26
Number: 1
Page Range: pp. 172-195
Date: 2000
Publisher: Springer
Language: English
Faculty: Faculty of Mathematics and Natural Sciences
Divisions: Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects: Data processing Computer science
Refereed: Yes
URI: http://kups.ub.uni-koeln.de/id/eprint/54788

Downloads

Downloads per month over past year

Export

Actions (login required)

View Item View Item