Research map / Learning theory and algorithms / Combinatorial and search optimization
Improved Results for Minimum Constraint Removal
Eduard Eiben, Jonathan Gemmell, Iyad Kanj, Andrew Youngdahl
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use Euclidean-distance heuristic in iterative deepening search | IDS · random obstacle instances n>50 | feasibility / runtime | Improved |
| use greedy search instead of IDS with the Euclidean heuristic | Euclidean-distance heuristic search · 100 random polygons | average time (s): 31.4 -> 4.4 | Improved |
| use greedy search instead of IDS with the minimum cover heuristic | Minimum-cover heuristic search · 100 random polygons | average time (s): 28.5 -> 3.2 | Improved |
| use greedy search instead of IDS-E | Euclidean-distance heuristic search · 1000 random rectangles | time (s): 684 -> 277 | Improved |
| use greedy heuristics instead of optimal search | Greedy-E and Greedy-MC · random instances | approximation ratio: 1 or close to it | No clear effect |
Closest papers by meaning
- Near-Optimal Edge Evaluation in Explicit Generalized Binomial Graphs (NeurIPS 2017 · similarity 0.83)
- Grid Pathfinding on the 2k Neighborhoods (AAAI 2017 · similarity 0.82)
- Optimal Makespan in a Minute Timespan! A Scalable Multi-Robot Goal Assignment Algorithm for Minimizing Mission Time (AAAI 2024 · similarity 0.81)
- Large-Scale Multi-Robot Coverage Path Planning via Local Search (AAAI 2024 · similarity 0.81)
- Heterogeneous Multi-Robot Graph Coverage with Proximity and Movement Constraints (AAAI 2025 · similarity 0.81)
- Inapproximability of Optimal Multi-Agent Pathfinding Problems (AAAI 2025 · similarity 0.81)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
