• 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 knowledgeExpand
Model-based Analysis of ChIP-Seq (MACS)
  • Yong Zhang, T. Liu, +8 authors X. Liu
  • Medicine, Biology
  • Genome Biology
  • 17 September 2008
This work presents Model-based Analysis of ChIP-Seq data, MACS, which analyzes data generated by short read sequencers such as Solexa's Genome Analyzer, and uses a dynamic Poisson distribution to effectively capture local biases in the genome, allowing for more robust predictions. Expand
Approximation Algorithms for Combinatorial Problems
  • D. Johnson
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1 December 1974
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. Expand
Some Simplified NP-Complete Graph Problems
This paper shows that a number of NP - complete problems remain NP -complete even when their domains are substantially restricted, and determines essentially the lowest possible upper bounds on node degree for which the problems remainNP -complete. Expand
Unit disk graphs
It is shown that many standard graph theoretic problems remain NP-complete on unit disks, including coloring, independent set, domination, independent domination, and connected domination; NP-completeness for the domination problem is shown to hold even for grid graphs, a subclass of unit disk graphs. Expand
The Complexity of Multiterminal Cuts
It is shown that the problem becomes NP-hard as soon as $k=3$, but can be solved in polynomial time for planar graphs for any fixed $k$, if the planar problem is NP- hard, however, if £k$ is not fixed. Expand
The Rectilinear Steiner Tree Problem in NP Complete
  • M. Garey, D. Johnson
  • Mathematics, Computer Science
  • SIAM Journal of Applied Mathematics
  • 1 June 1977
The problem of determining the minimum length of an optimum rectilinear Steiner tree for a set A of points in the plane is shown to be NP-complete and the emphasis of the literature on heuristics and special case algorithms is well justified. Expand
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. Expand