Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics (Q5145837): Difference between revisions

@@ Property / DOI @@
-.1613/jair.1.12278
@@ Property / DOI: 10.1613/jair.1.12278 / rank @@
-Normal rank
@@ Property / cites work @@
+Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis
+Normal rank
@@ Property / cites work @@
+Minimum propositional proof length is NP-hard to linearly approximate
+Normal rank
@@ Property / cites work @@
+Time and Space Bounds for Planning
@@ Property / cites work: Time and Space Bounds for Planning / rank @@
+Normal rank
@@ Property / cites work @@
+A complete parameterized complexity analysis of bounded planning
+Normal rank
@@ Property / cites work @@
+The computational complexity of propositional STRIPS planning
+Normal rank
@@ Property / cites work @@
+Steiner Tree Approximation via Iterative Randomized Rounding
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Directed Steiner Problems
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+MANAGING TEMPORAL CYCLES IN PLANNING PROBLEMS REQUIRING CONCURRENCY
+Normal rank
@@ Property / cites work @@
+Monotone Temporal Planning: Tractability, Extensions and Applications
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating label-cover
@@ Property / cites work: On the hardness of approximating label-cover / rank @@
+Normal rank
@@ Property / cites work @@
+Red-black planning: a new systematic approach to partial delete relaxation
+Normal rank
@@ Property / cites work @@
+Q5313998
@@ Property / cites work: Q5313998 / rank @@
+Normal rank
@@ Property / cites work @@
+Polylogarithmic inapproximability
@@ Property / cites work: Polylogarithmic inapproximability / rank @@
+Normal rank
@@ Property / cites work @@
+Q3624014
@@ Property / cites work: Q3624014 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2717791
@@ Property / cites work: Q2717791 / rank @@
+Normal rank
@@ Property / cites work @@
+Strong bounds on the approximability of two Pspace-hard problems in propositional planning
+Normal rank
@@ Property / cites work @@
+State-variable planning under structural restrictions: algorithms and complexity
+Normal rank
@@ Property / cites work @@
+Sound and Complete Landmarks for And/Or Graphs
@@ Property / cites work: Sound and Complete Landmarks for And/Or Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Backdoors to planning
@@ Property / cites work: Backdoors to planning / rank @@
+Normal rank
@@ Property / cites work @@
+Q2941638
@@ Property / cites work: Q2941638 / rank @@
+Normal rank
@@ Property / cites work @@
+The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
+Normal rank
@@ Property / Wikidata QID @@
+Q130991632
@@ Property / Wikidata QID: Q130991632 / rank @@
+Normal rank
@@ Property / DOI @@
+.1613/JAIR.1.12278
@@ Property / DOI: 10.1613/JAIR.1.12278 / rank @@
+Normal rank