Empirical hardness models: Methodology and a case study on combinatorial auctions

@article{LeytonBrown2009EmpiricalHM,
  title={Empirical hardness models: Methodology and a case study on combinatorial auctions},
  author={Kevin Leyton-Brown and Eugene Nudelman and Yoav Shoham},
  journal={J. ACM},
  year={2009},
  volume={56},
  pages={22:1-22:52}
}
Is it possible to predict how long an algorithm will take to solve a previously-unseen instance of an NP-complete problem? If so, what uses can be found for models that make such predictions? This article provides answers to these questions and evaluates the answers experimentally. We propose the use of supervised machine learning to build models that predict an algorithm's runtime given a problem instance. We discuss the construction of these models and describe techniques for interpreting… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 87 CITATIONS, ESTIMATED 28% COVERAGE

FILTER CITATIONS BY YEAR

2007
2019

CITATION STATISTICS

  • 12 Highly Influenced Citations

  • Averaged 10 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

Similar Papers

Loading similar papers…