APPROX 2010 | Sciweavers

We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...

MohammadHossein Bateni, Julia Chuzhoy

claim paper

Read More »

9

click to vote

APPROX
2010
Springer

131views Algorithms» more APPROX 2010»

Testing Boolean Function Isomorphism

13 years 6 months ago

Download www.cs.tau.ac.il

Noga Alon, Eric Blais

claim paper

Read More »

15

click to vote

APPROX
2010
Springer

132views Algorithms» more APPROX 2010»

Relativized Worlds without Worst-Case to Average-Case Reductions for NP

13 years 6 months ago

Download www.cs.berkeley.edu

We prove that relative to an oracle, there is no worst-case to average-case reduction for NP. We also handle classes that are somewhat larger than NP, as well as worst-case to err...

Thomas Watson

claim paper

Read More »

13

click to vote

APPROX
2010
Springer

133views Algorithms» more APPROX 2010»

Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries

13 years 6 months ago

Download www.eng.tau.ac.il

Elya Dolev, Dana Ron

claim paper

Read More »

14

click to vote

APPROX
2010
Springer

207views Algorithms» more APPROX 2010»

Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses

13 years 6 months ago

Download www.cs.uoi.gr

Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...

Spyros C. Kontogiannis, Paul G. Spirakis

claim paper

Read More »

11

click to vote

APPROX
2010
Springer

118views Algorithms» more APPROX 2010»

Better Size Estimation for Sparse Matrix Products

13 years 6 months ago