R. Battiti, A. A. Bertossi, and R. Rizzi. Randomized Greedy Algorithms for the Hypergraph Partitioning Problem, Proceedings of the DIMACS Workshop on Randomization Methods in Algorithm Design, Princeton, Oct 20,  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Lattice gas: An efficient and reusable parallel library.. - Alexandre Dupuis And (1999) (Correct)
....already shows that for a small graph of 40 vertices there are 10 20 4 way possible partitions. Therefore, to solve this problem one has to find relevant heuristics. After the famous Kernighan Lin algorithm [7] in 1970 many interesting approaches have been proposed such as greedy heuristics [8 10], genetic algorithms [11, 12] simulated annealing techniques [13] spectral partitioning methods [14] or multilevel algorithms [15] Two important criteria of such methods are the cost of the partition computation and the quality of the partition. The multilevel algorithms seem to well satisfy ....
Roberto Battiti, Alan Bertossi, and R. Rizzi. Randomized greedy algorithms for the hypergraph partitioning problem. In DIMACS Workshop on Randomization Methods in Algorithm Design, October 1997.
An Object Oriented Approach to Lattice Gas Modeling - Dupuis, Chopard (1999) (Correct)
....calculation shows that for a small graph of 40 vertices there are 10 20 4 way possible partitions. Therefore, one has to find relevant heuristics to solve this problem. After the famous KernighanLin algorithm [9] in 1970 many interesting approaches have been proposed such as greedy heuristics [10, 11, 12], genetic algorithms [13, 14] simulated annealing techniques [15] spectral partitioning methods [16] or multilevel algorithms [17] Two important criteria of such methods are the cost of the partition computation and the quality of the partition. The multilevel algorithms seem to well satisfy ....
Roberto Battiti, Alan Bertossi, and R. Rizzi. Randomized greedy algorithms for the hypergraph partitioning problem. In DIMACS Workshop on Randomization Methods in Algorithm Design, October 1997.
Partially Persistent Dynamic Sets for History-Sensitive Heuristics - Battiti Self-citation (Battiti) (Correct)
....performance with respect to alternative heuristics like Fixed TS, Simulated Annealing, Neural Networks, and Genetic Algorithms. In particular, state of the art heuristic results have been obtained for the Maximum Clique problem [3] Maximum Satisfiability [4] and Graph and Hypergraph Partitioning [1, 2]. The history management operations required by Reactive TS are X Insert(X; t) to insert a given configuration X into memory, and X Search(X) to search for a given X. X Search(X) returns a reference to satellite data associated to the key X if X is present, Null otherwise. Satellite data in ....
R. Battiti, A. A. Bertossi, and R. Rizzi. Randomized Greedy Algorithms for the Hypergraph Partitioning Problem, Proceedings of the DIMACS Workshop on Randomization Methods in Algorithm Design, Princeton, Oct 20,
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