Join Our Newsletter

IPL

2010

9 years 2 months ago
2010

An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...

SIAMCOMP

1998

9 years 3 months ago
1998

We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...

ORL

1998

9 years 3 months ago
1998

Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...

DAM

1999

9 years 3 months ago
1999

The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...

IPL

1998

9 years 3 months ago
1998

The k-MST problem requires ﬁnding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...

IPL

2002

9 years 3 months ago
2002

The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation

ALGORITHMICA

1999

9 years 3 months ago
1999

In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...

MOR

2000

9 years 3 months ago
2000

Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...

CORR

2002

Springer

9 years 3 months ago
2002

Springer

In this paper we study approximation algorithms for solving a general covering integer program. An