Trees of shortest Paths vs. Steiner trees: Understanding and improving delete relaxation heuristics

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 1734-1739

  Keyder, Emil ^a   Geffner, Héctor ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTATION THEORY; HEURISTIC ALGORITHMS; TREES (MATHEMATICS);

BENCHMARK DOMAINS; BEST FIRST SEARCH; HEURISTIC SEARCH; INDEPENDENCE ASSUMPTION; OPTIMAL SOLUTIONS; SHORTEST PATH; STEINER TREE PROBLEM; STEINER TREES;

HEURISTIC METHODS;

EID: 78651426831     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. G. Ausiello, R. Giaccio, G. F. Italiano, and U. Nanni. Optimal traversal of directed hypergraphs. Technical Report TR-92-073, International Computer Science Institute, 1992.
2. B. Bonet and H. Geffner. Planning as heuristic search. Artificial Intelligence, 129(1-2):5-33, 2001.
3. T. Bylander. The computational complexity of STRIPS planning. Artificial Intelligence, 69:165-204, 1994.
4. M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li. Approximation algorithms for directed Steiner problems. In Journal of Algorithms, pages 73-91, 1998.
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, 1989.
6. M. Helmert. The Fast Downward planning system. Journal of Artificial Intelligence Research, 26:191-246, 2006.
7. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14:253-302, 2001.
8. E. Keyder and H. Geffner. Set-additive and TSP heuristics for planning with action costs and soft goals. In Proc. 2007 ICAPS Workshop on Heuristics for Domain-Independent Planning, 2007.
9. E. Keyder and H. Geffner. Heuristics for planning with action costs revisited. In Proc. 18th European Conference on Artificial Intelligence, pages 588-592, 2008.
10. H. Proemel and A. Steger. The Steiner Tree Problem: A Tour Through Graphs, Algorithms, and Complexity. Vieweg+Teubner Verlag, 2002.
11. G. Robins and A. Zelikovsky. Improved Steiner tree approximation in graphs. In SODA, pages 770-779, 2000.
12. R. Sanchez and S. Kambhampati. Planning graph heuristics for selecting objectives in over-subscription planning problems. In Proc. ICAPS-05, pages 192-201, 2005.
13. D. E. Smith. Choosing objectives in over-subscription planning. In Proc. ICAPS-04, pages 393-401, 2004.