An Atypical Survey of Typical-Case Heuristic Algorithms

10/30/2012
by   Lane A. Hemaspaandra, et al.
0

Heuristic approaches often do so well that they seem to pretty much always give the right answer. How close can heuristic algorithms get to always giving the right answer, without inducing seismic complexity-theoretic consequences? This article first discusses how a series of results by Berman, Buhrman, Hartmanis, Homer, Longpré, Ogiwara, Schöening, and Watanabe, from the early 1970s through the early 1990s, explicitly or implicitly limited how well heuristic algorithms can do on NP-hard problems. In particular, many desirable levels of heuristic success cannot be obtained unless severe, highly unlikely complexity class collapses occur. Second, we survey work initiated by Goldreich and Wigderson, who showed how under plausible assumptions deterministic heuristics for randomized computation can achieve a very high frequency of correctness. Finally, we consider formal ways in which theory can help explain the effectiveness of heuristics that solve NP-hard problems in practice.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/07/2022

The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems

The A* algorithm is commonly used to solve NP-hard combinatorial optimiz...
research
06/22/2016

Étude de Problèmes d'Optimisation Combinatoire à Multiples Composantes Interdépendantes

This extended abstract presents an overview on NP-hard optimization prob...
research
08/20/2020

Faster Heuristics for Graph Burning

Graph burning is a process of information spreading through the network ...
research
01/23/2018

Heuristic algorithms for the Maximum Colorful Subtree problem

In metabolomics, small molecules are structurally elucidated using tande...
research
06/08/2020

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms

Parameterization and approximation are two popular ways of coping with N...
research
04/04/2023

Online Learning for Scheduling MIP Heuristics

Mixed Integer Programming (MIP) is NP-hard, and yet modern solvers often...
research
09/12/2019

Optimal Routing Schedules for Robots Operating in Aisle-Structures

In this paper, we consider the Constant-cost Orienteering Problem (COP) ...

Please sign up or login with your details

Forgot password? Click here to reset