• Publications
  • Influence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge
Approximation algorithms for combinatorial problems
For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as n^@e, where n is the problem size and @e>0 depends on the algorithm.
Some Simplified NP-Complete Graph Problems
Unit disk graphs
How easy is local search?
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
This work examines the performance of a number of simple algorithms which obtain “good” placements and shows that neither the first-fit nor the best-fit algorithm will ever use more than $\frac{17}{10}L^ * + 2$ bins.
The Traveling Salesman Problem: A Case Study in Local Optimization
This chapter discusses how various approaches to combinatorial optimization have been adapted to the TSP and evaluates their relative success in this perhaps atypical domain from both a theoretical and an experimental point of view.