Research map / Learning theory and algorithms / Combinatorial and search optimization
Finding One Local Optimum Is Easy—but What About Two?
Yasuaki Kobayashi, Kazuhiro Kurita, Yutaro Yamaguchi
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Learning-Augmented Approximation Algorithms for Maximum Cut and Related Problems (NeurIPS 2024 · similarity 0.86)
- The Query Complexity of Local Search in Rounds on General Graphs (NeurIPS 2026 · similarity 0.86)
- Approximation algorithms for combinatorial optimization with predictions (ICLR 2025 · similarity 0.85)
- Differentiable Quadratic Optimization For the Maximum Independent Set Problem (ICML 2025 · similarity 0.85)
- The Complexity of Finding Local Optima in Contrastive Learning (NeurIPS 2025 · similarity 0.85)
- Polynomial Time Learning Augmented Algorithms for NP-hard Permutation Problems (ICML 2025 · similarity 0.85)
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.
