Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Heuristic search in restricted memory (research note)
Artificial Intelligence
Efficient memory-bounded search methods
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Mathematical Programming: Series A and B
Artificial Intelligence
Computers and Operations Research - Special issue: heuristic, genetic and tabu search
BIDA: an improved perimeter search algorithm
Artificial Intelligence
Performance of linear-space search algorithms
Artificial Intelligence
A branch-and-cut algorithm for the equicut problem
Mathematical Programming: Series A and B
The node capacitated graph partitioning problem: a computational study
Mathematical Programming: Series A and B - Special issue on computational integer programming
Sokoban: enhancing general single-agent search methods using domain knowledge
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Disjoint pattern database heuristics
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Behind Deep Blue: Building the Computer that Defeated the World Chess Champion
Behind Deep Blue: Building the Computer that Defeated the World Chess Champion
Graph Partitioning Using Learning Automata
IEEE Transactions on Computers
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
HPCN Europe 1996 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Solving Graph Bisection Problems with Semidefinite Programming
INFORMS Journal on Computing
Additive pattern database heuristics
Journal of Artificial Intelligence Research
Finding optimal solutions to the twenty-four puzzle
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Finding optimal solutions to Rubik's cube using pattern databases
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Regionalization with dynamically constrained agglomerative clustering and partitioning (REDCAP)
International Journal of Geographical Information Science
The generalized A* architecture
Journal of Artificial Intelligence Research
Computer Science Review
Hi-index | 0.00 |
As search spaces become larger and as problems scale up, an efficient way to speed up the search is to use a more accurate heuristic function. A better heuristic function might be obtained by the following general idea. Many problems can be divided into a set of subproblems and subgoals that should be achieved. Interactions and conflicts between unsolved subgoals of the problem might provide useful knowledge which could be used to construct an informed heuristic function. In this paper we demonstrate this idea on the graph partitioning problem (GPP). We first show how to format GPP as a search problem and then introduce a sequence of admissible heuristic functions estimating the size of the optimal partition by looking into different interactions between vertices of the graph. We then optimally solve GPP with these heuristics. Experimental results show that our advanced heuristics achieve a speedup of up to a number of orders of magnitude. Finally, we experimentally compare our approach to other states of the art graph partitioning optimal solvers on a number of classes of graphs. The results obtained show that our algorithm outperforms them in many cases.