Sciweavers

122

STOC
1995
ACM

145views Algorithms» more STOC 1995»

Polynomial time approximation schemes for dense instances of NP-hard problems

15 years 8 months ago

We present a uniﬁed framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...

Sanjeev Arora, David R. Karger, Marek Karpinski

claim paper

Read More »

90

click to vote

STOC
1995
ACM

114views Algorithms» more STOC 1995»

Sorting in linear time?

15 years 8 months ago

Download web.mit.edu

Arne Andersson, Torben Hagerup, Stefan Nilsson, Ra...

claim paper

Read More »

126

click to vote

STACS
1995
Springer

71views Theoretical Computer Science» more STACS 1995»

The Number of Views of Piecewise-Smooth Algebraic Objects

15 years 8 months ago

Download www.loria.fr

Abstract. A solid object in 3-dimensional space may be described by a collection of all its topologically distinct 2-dimensional appearances, its aspect graph. In this paper, we st...

Sylvain Petitjean

claim paper

Read More »

109

click to vote

STACS
1995
Springer

110views Theoretical Computer Science» more STACS 1995»

On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract)

15 years 8 months ago