Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor

Author(s):

Kötzing, Timo
Lehre, Per Kristian
Neumann, Frank
Oliveto, Pietro S.

dblp
dblp
dblp
dblp

Not MPG Author(s):

Lehre, Per Kristian
Oliveto, Pietro S.

Editor(s):

Pelikan, Martin
Branke, Jürgen

dblp
dblp

Not MPII Editor(s):

Pelikan, Martin
Branke, Jürgen

BibTeX cite key*:

Koe-Leh-Neu-Oli:c:10:AcoMinCut

Title, Booktitle

Title*:

Ant Colony Optimization and the Minimum Cut Problem

Booktitle*:

Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010)

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

Portland, USA

Language:

English

Event Date*
(no longer used):


Organization:

Association for Computing Machinery (ACM)

Event Start Date:

7 July 2010

Event End Date:

11 July 2010

Publisher

Name*:

ACM

URL:


Address*:

New York, NY

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

1393-1400

Year*:

2010

VG Wort Pages:


ISBN/ISSN:

978-1-4503-0072-5

Sequence Number:


DOI:

10.1145/1830483.1830741



Note, Abstract, ©


(LaTeX) Abstract:

Ant Colony Optimization (ACO) is a powerful metaheuristic for solving combinatorial optimization problems. With this paper we contribute to the theoretical understanding of this kind of algorithm by investigating the classical minimum cut problem.
An ACO algorithm similar to the one that was proved successful for the minimum spanning tree problem is studied.
Using rigorous runtime analyses we show how the ACO algorithm behaves similarly to Karger and Stein's algorithm for the minimum cut problem as long as the use of pheromone values is limited. Hence optimal solutions are obtained in expected polynomial time. On the other hand, we show that high use of pheromones has a negative effect, and the ACO algorithm may get trapped in local optima resulting in an exponential runtime to obtain an optimal solution.
This result indicates that ACO algorithms may be inappropriate for finding minimum cuts.



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Koe-Leh-Neu-Oli:c:10:AcoMinCut,
AUTHOR = {K{\"o}tzing, Timo and Lehre, Per Kristian and Neumann, Frank and Oliveto, Pietro S.},
EDITOR = {Pelikan, Martin and Branke, J{\"u}rgen},
TITLE = {Ant Colony Optimization and the Minimum Cut Problem},
BOOKTITLE = {Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010)},
PUBLISHER = {ACM},
YEAR = {2010},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PAGES = {1393--1400},
ADDRESS = {Portland, USA},
ISBN = {978-1-4503-0072-5},
DOI = {10.1145/1830483.1830741},
}


Entry last modified by Anja Becker, 02/14/2011
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]
Created
12/15/2010 11:45:23 AM
Revisions
3.
2.
1.
0.
Editor(s)
Anja Becker
Anja Becker
Timo Kötzing
Timo Kötzing
Edit Dates
14.02.2011 12:54:36
10.01.2011 14:29:46
12/15/2010 11:55:51 AM
12/15/2010 11:45:23 AM
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section