Book contents
- Frontmatter
- Contents
- Preface
- List of Contributors
- 1 Introduction
- Part One Refinements of Worst-Case Analysis
- Part Two Deterministic Models of Data
- Part Three Semirandom Models
- Part Four Smoothed Analysis
- Part Five Applications in Machine Learning and Statistics
- Part Six Further Applications
- 24 Beyond Competitive Analysis
- 25 On the Unreasonable Effectiveness of SAT Solvers
- 26 When Simple Hash Functions Suffice
- 27 Prior-Independent Auctions
- 28 Distribution-Free Models of Social Networks
- 29 Data-Driven Algorithm Design
- 30 Algorithms with Predictions
- Index
29 - Data-Driven Algorithm Design
from Part Six - Further Applications
Published online by Cambridge University Press: 17 December 2020
Edited by
Book contents
- Frontmatter
- Contents
- Preface
- List of Contributors
- 1 Introduction
- Part One Refinements of Worst-Case Analysis
- Part Two Deterministic Models of Data
- Part Three Semirandom Models
- Part Four Smoothed Analysis
- Part Five Applications in Machine Learning and Statistics
- Part Six Further Applications
- 24 Beyond Competitive Analysis
- 25 On the Unreasonable Effectiveness of SAT Solvers
- 26 When Simple Hash Functions Suffice
- 27 Prior-Independent Auctions
- 28 Distribution-Free Models of Social Networks
- 29 Data-Driven Algorithm Design
- 30 Algorithms with Predictions
- Index
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Beyond the Worst-Case Analysis of Algorithms , pp. 626 - 645Publisher: Cambridge University PressPrint publication year: 2021
- 6
- Cited by