Journal: Algorithmica

Found 758 papers in total
On capital investment
On capital investment
1999,
We deal with the problem of making capital investments in machines for manufacturing a...
Linear-space algorithms that build local alignments from fragments
Linear-space algorithms that build local alignments from fragments
1995,
This paper presents practical algorithms for building an alignment of two long...
Lower bounds for set intersection queries
Lower bounds for set intersection queries
1995,
We consider the following set intersection reporting problem. We have a collection of...
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
1996,
The linear programming relaxation of the minimum vertex coloring problem, called the...
Algorithms for dense graphs and networks on random-access computers
Algorithms for dense graphs and networks on random-access computers
1996,
We improve upon the running time of several graph and network algorithms when applied...
Primal–dual approximation algorithms for integral flow and multicut in trees
Primal–dual approximation algorithms for integral flow and multicut in trees
1997,
We study the maximum integral multicommodity flow problem and the minimum multicut...
Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
1995,
Recent work in the design of efficient algorithms for optimization problems on...
Parametric optimization of sequence alignment
Parametric optimization of sequence alignment
1994,
The optimal alignment or the weighted minimum edit distance between two DNA or amino...
Optimal-algorithms for dissemination of information in some interconnection networks
Optimal-algorithms for dissemination of information in some interconnection networks
1993,
The problems of gossiping and broadcasting in one-way communication mode are...
A fast algorithm for the generalized parametric minimum cut problem and applications
A fast algorithm for the generalized parametric minimum cut problem and applications
1992,
Many combinatorial optimization problems are solved by a sequence of network flow...
Extracting maximal information about sets of minimum cuts
Extracting maximal information about sets of minimum cuts
1993,
There are two well-known, elegant, compact, and efficiently computed representations...
A faster parametric minimum-cut algorithm
A faster parametric minimum-cut algorithm
1994,
Gallo et al recently examined the problem of computing on-line a sequence of k maximum...
On the efficiency of maximum-flow algorithms on networks with small integer capacities
On the efficiency of maximum-flow algorithms on networks with small integer capacities
1989,
The performance of maximum-flow algorithms that work in phases is studied as a...
A new algorithm for scheduling periodic, real-time tasks
A new algorithm for scheduling periodic, real-time tasks
1989,
The paper considers the problem of preemptively scheduling a set of periodic,...
Papers per page: