(Enter summary)
Abstract: In this paper, new multilevel heuristics are proposed for finding a balanced bipartition
of a graph. Multilevel schemes have been recently introduced for quickly solving the
problem on graphs with thousands of nodes, graphs often present in domain-decomposition
techniques for parallel computing. These heuristics firstly reduce the original graph by
collapsing its nodes and arcs, thus generating a hierarchy of smaller and smaller graphs,
then find a good partition of the smallest graph, and ... (Update)
Context of citations to this paper: More
.... Indeed, in the case of graph partitioning, examples of multilevel implementations exist for simulated annealing, 34] tabu search, [2, 34], and even genetic algorithms, 21] The refinement algorithm must also be able to cope with any additional restrictions placed on it...
Cited by: More
Multilevel Refinement for Combinatorial Optimisation Problems - Walshaw (2001)
(Correct)
A Multilevel Approach to the Graph Colouring Problem - Walshaw (2001)
(Correct)
Multilevel Landscapes in Combinatorial Optimisation - Chris Walshaw And
(Correct)
Active bibliography (related documents): More All
0.7: Greedy, Prohibition, and Reactive Heuristics for Graph.. - Battiti, Bertossi (1998)
(Correct)
0.3: Memetic Algorithms for Combinatorial Optimization Problems.. - Merz (2001)
(Correct)
0.3: Fitness Landscapes and Memetic Algorithm Design - Merz, Freisleben (1999)
(Correct)
Similar documents based on text: More All
0.4: Local Search with Memory: Benchmarking RTS - Battiti (1995)
(Correct)
0.3: Reactive Search, a history-based heuristic for MAX-SAT - Battiti, Protasi (1996)
(Correct)
0.3: Distributed Saturation Degree Methods for Code.. - Battiti, Bertossi.. (2000)
(Correct)
Related documents from co-citation: More All
7: A Retrofit Based Methodology for the Fast Generation and Optimization of Large-S.. (context) - Vanderstraeten, Farhat et al. - 1996
7: Mesh Partitioning: a Multilevel Balancing and Refinement Algorithm
- Walshaw, Cross - 1998
7: and Smoothing: Elements of the Multilevel Method (context) - Teng, Sampling - 1999
BibTeX entry: (Update)
R. Battiti, A. Bertossi, and A. Cappelletti. Multilevel Reactive Tabu Search for Graph Partitioning. Preprint UTM 554, Dip. Mat., Univ. Trento, Italy, 1999. http://citeseer.ist.psu.edu/battiti99multilevel.html More
@misc{ battiti99multilevel,
author = "R. Battiti and A. Bertossi and A. Cappelletti",
title = "Multilevel Reactive Tabu Search for Graph Partitioning",
text = "R. Battiti, A. Bertossi, and A. Cappelletti. Multilevel Reactive Tabu Search
for Graph Partitioning. Preprint UTM 554, Dip. Mat., Univ. Trento, Italy,
1999.",
year = "1999",
url = "citeseer.ist.psu.edu/battiti99multilevel.html" }
Citations (may not include all citations):
773
Reducibility among combinatorial problems (context) - Karp - 1972
429
An efficient heuristic procedure for partitioning graphs (context) - Kernighan, Lin - 1970
312
Tabu Search - part (context) - Glover - 1989
309
Partitioning sparse matrices with eigenvectors of graphs (context) - Pothen, Simon et al. - 1990
288
A Fast and High Quality Multilevel Scheme for Partitioning I..
- Karypis, Kumar - 1995
288
Introduction to Parallel Computing: Design and Analysis of A.. (context) - Kumar, Grama et al. - 1994
244
A multilevel algorithm for partitioning graphs
- Hendrickson, Leland - 1993
225
Some simplified NP-complete graph problems (context) - Garey, Johnson et al. - 1976
222
A fast multilevel implementation of recursive spectral bisec..
- Barnard, Simon - 1995
178
Sparse Matrix Test Problems (context) - Duff, Grimmes et al. - 1989
115
An improved spectral graph partitioning algorithm for mappin..
- Hendrickson, Leland - 1992
67
A unified geometric approach to graph separators (context) - Miller, Teng et al. - 1991
65
Dynamic load-balancing for PDE solvers on adaptive unstructu..
- Walshaw, Berzins - 1995
63
Algorithms for the maximum satisfiability problem (context) - Hansen, Jaumard - 1990
42
Analysis of Multilevel Graph Partitioning
- Karypis, Kumar - 1995
39
Fast and effective algorithms graph partitioning and sparse-..
- Gupta - 1997
28
Toward a fast implementation of spectral nested dissection (context) - Pothen, Simon et al. - 1992
26
Finding good approximate vertex and edge partitions is NP-ha.. (context) - Bui, Jones - 1992
26
The Chaco user's guide (context) - Hendrickson, Leland - 1993
24
Reactive Search: Toward self-tuning heuristics
- Battiti - 1996
15
A Local Graph partitioning Heuristic Meeting Bisection Bound..
- Monien, Diekman - 1997
11
Multilevel k-way Partitioning Scheme for Irregular Graphs
- Karypis, Kumar - 1995
7
The Party Partitioning Library, User guide (context) - Preis, Diekmann - 1996
3
Differential Greedy for the 0-1 Equicut Problem (context) - Battiti, Bertossi - 1998
3
Greedy, Prohibition, and Reactive Heuristics for Graph Parti..
- Battiti, Bertossi - 1999
1
Algorithms foe static and dynamic Load Balancing on Parallel.. (context) - Van Driessche - 1995
http://www.uni-paderborn.de/fachbereich/AG/monien/RESEARCH/PART/graphs.html
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://rtm.science.unitn.it/~battiti/battiti-publications.html): More
Assigning Codes in Wireless Networks: Bounds and.. - Battiti, Bertossi.. (1999)
(Correct)
Load Balanced Mappings of q-ary and Binomial Trees into.. - Das, Pinotti
(Correct)
Distributed Code Assignment in Multihop Radio Networks: .. - Battiti, Bertossi.. (2000)
(Correct)
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