The Karloff–Zwick algorithm, in computational complexity theory, is a randomised approximation algorithm taking an instance of MAX-3SAT Boolean… (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

- Mihai Patrascu, Liam Roditty
- 2010 IEEE 51st Annual Symposium on Foundations of…
- 2010

We give the first improvement to the space/approximation trade-off of distance oracles since the seminal result of Thorup and… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Ryan M Williams
- Inf. Process. Lett.
- 2009

The k-path problem is to determine if a given graph contains a simple path of length at least k, and if so, produce such a path… (More)

Is this relevant?

2008

2008

- Franck Cassez, Stavros Tripakis
- Fundam. Inform.
- 2008

We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser… (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

In this paper we present approximation algorithms for the maximum constraint satisfaction problem with <i>k</i> variables in each… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Surender Baswana, Sandeep Sen
- ACM Trans. Algorithms
- 2006

Let <i>G</i> = (<i>V</i>, <i>E</i>) be an undirected graph on <i>n</i> vertices, and let Δ(<i>u</i>, <i>v</i>) denote the… (More)

Is this relevant?

2006

2006

- Jacob A. Cohen
- 2006

Set correlation is a realization of the general multivariate linear model, can be viewed as a multivariate generalization of… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Michael R. Fellows, Christian Knauer, +5 authors Sue Whitesides
- Algorithmica
- 2004

We obtain faster algorithms for problems such as r-dimensional matching and r-set packing when the size k of the solution is… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Werner Güth, Steffen Huck, Wieland Müller
- Games and Economic Behavior
- 2001

In this note we present a slightly altered version of the mini ultimatum game of G. E. Bolton and R. Zwick (1995, Games Econ… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Takao Asano, David P. Williamson
- SODA
- 2000

MAX SAT (the maximum s~tisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Eran Halperin
- SODA
- 2000

1 I n t r o d u c t i o n Given a hypergraph H= (V,E), a ver tex cover of H is a set C C V such that for every e E E, there… (More)

Is this relevant?