172 citations
- Courant Institute of Mathematical SciencesUS3 papers
- Cornell UniversityUS2 papers
- The University of TokyoJP2 papers
- University of California, DavisUS2 papers
- University of Illinois Urbana-ChampaignUS2 papers
- University of PisaIT2 papers
- University of WaterlooCA2 papers
- Amsterdam University of the ArtsNL1 paper
- Columbia UniversityUS1 paper
- Fraunhofer-GesellschaftDE1 paper
- Georgia Institute of TechnologyUS1 paper
- Harvard University PressUS1 paper
Showing 2008 · cs.DSShow all
2 papers · 2 filters
cs.DS2008★ 5 cited
Phase transition for Local Search on planted SAT
Andrei A. Bulatov, Evgeny S. Skvortsov
The Local Search algorithm (or Hill Climbing, or Iterative Improvement) is one of the simplest heuristics to solve the Satisfiability and Max-Satisfiability problems. It is a part…
cs.DS2008★ 3 cited
Algorithms for Secretary Problems on Graphs and Hypergraphs
Nitish Korula, Martin Pal
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We…