Join Our Newsletter

ESA

2011

Springer

7 years 7 months ago
2011

Springer

Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R2 . These include Tukey depth [15], O...

DAM

1999

8 years 7 months ago
1999

This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...

JCSS

2008

8 years 7 months ago
2008

We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...

ISAAC

2000

Springer

8 years 10 months ago
2000

Springer

It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...

ASPDAC

2007

ACM

8 years 11 months ago
2007

ACM

The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...

STOC

1999

ACM

8 years 11 months ago
1999

ACM

We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the ﬁrst polynomial time approximation a...

AAIM

2007

Springer

9 years 1 months ago
2007

Springer

Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...