Journal: Algorithmica

Found 758 papers in total
On two class-constrained versions of the multiple knapsack problem
On two class-constrained versions of the multiple knapsack problem
2001,
We study two variants of the classic knapsack problem, in which we need to place items...
Efficient algorithms for integer programs with two variables per constraint
Efficient algorithms for integer programs with two variables per constraint
2001,
Given a bounded integer program with n variables and m constraints, each with two...
Exact algorithms for linear programming over algebraic extensions
Exact algorithms for linear programming over algebraic extensions
2001,
We study the computational complexity of linear programs with coefficients that are...
Algorithms for the on-line travelling salesman
Algorithms for the on-line travelling salesman
2001,
In this paper the problem of efficiently serving a sequence of requests presented in...
New algorithms for disk scheduling
New algorithms for disk scheduling
2002,
Processor speed and memory capacity are increasing several times faster than disk...
Efficient regular data structures and algorithms for dilation, location, and proximity problems
Efficient regular data structures and algorithms for dilation, location, and proximity problems
2001,
In this paper we investigate data structures obtained by a recursive partitioning of...
Optimal time-critical scheduling via resource augmentation
Optimal time-critical scheduling via resource augmentation
2002,
We consider two fundamental problems in dynamic scheduling: scheduling to meet...
Optimal search and one-way trading online algorithms
Optimal search and one-way trading online algorithms
2001,
This paper is concerned with the time series search and one-way trading problems. In...
The structure and complexity of sports elimination numbers
The structure and complexity of sports elimination numbers
2002,
Identifying the teams that are already eliminated from contention for first place of a...
Optimal edge ranking of trees in linear time
Optimal edge ranking of trees in linear time
2001,
Given a tree, finding an optimal node ranking and finding an optimal edge ranking are...
Approximation algorithms for degree-constrained minimum-cost network-design problems
Approximation algorithms for degree-constrained minimum-cost network-design problems
2001,
We study network-design problems with two different design objectives: the total cost...
Reconstructing a minimum spanning tree after deletion of any node
Reconstructing a minimum spanning tree after deletion of any node
2001,
Updating a minimum spanning tree (MST) is a basic problem for communication networks....
On nonlinear parametric search
On nonlinear parametric search
2001,
An alternative viewpoint for parametric search is presented, which achieves a bound...
On two class-constrained versions of the multiple knapsack problem
On two class-constrained versions of the multiple knapsack problem
2001,
We study two variants of the classic knapsack problem, in which we need to place items...
Efficient algorithms for integer programs with two variables per constraint
Efficient algorithms for integer programs with two variables per constraint
2001,
Given a bounded integer program with n variables and rn constraints, each with two...
Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times
Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times
2001,
This paper addresses scheduling problems for tasks with release and execution times....
Bounded space on-line bin packing: Best is better than first
Bounded space on-line bin packing: Best is better than first
2001,
We present a sequence of new linear-time, bounded-space, on-line bin packing...
Exact algorithms for linear programming over algebraic extensions
Exact algorithms for linear programming over algebraic extensions
2001,
We study the computational complexity of linear programs with coefficients that are...
Algorithms for the on-line travelling salesman
Algorithms for the on-line travelling salesman
2001,
In this paper the problem of efficiently serving a sequence of requests presented in...
Optimal search and one-way trading online algorithms
Optimal search and one-way trading online algorithms
2001,
This paper is concerned with the time series search and one-way trading problems. In...
Steiner minimal trees with one polygonal obstacle
Steiner minimal trees with one polygonal obstacle
2001,
In this paper we study the Steiner minimal tree T problem for a point set Z with...
Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
2000,
Let G = (V, E) be a complete undirected graph with vertex set V, edge set E, and edge...
One for the price of two: A unified approach for approximating covering problems
One for the price of two: A unified approach for approximating covering problems
2000,
We present a simple and unified approach for developing and analyzing approximation...
Shortest path geometric rounding
Shortest path geometric rounding
2000,
Exact implementations of algorithms of computational geometry are subject to...
Papers per page: