Journal: Algorithmica

Found 758 papers in total
The minimum range assignment problem on linear radio networks
The minimum range assignment problem on linear radio networks
2003,
Given a set S of radio stations located on a line and an integer h ≥ 1, the MIN...
Temporary tasks assignment resolved
Temporary tasks assignment resolved
2003,
Among all basic on-line load balancing problems, the only unresolved problem was load...
Dynamic programming on the word RAM
Dynamic programming on the word RAM
2003,
Dynamic programming is one of the fundamental techniques for solving optimization...
New bounds for multidimensional packing
New bounds for multidimensional packing
2003,
New upper and lower bounds are presented for a multidimensional generalization of bin...
Time-constrained scheduling of weighted packets on trees and meshes
Time-constrained scheduling of weighted packets on trees and meshes
2003,
The time-constrained packet routing problem is to schedule a set of packets to be...
Multicast pull scheduling: When fairness is fine
Multicast pull scheduling: When fairness is fine
2003,
We investigate server scheduling policies to minimize average user perceived latency...
Semi-on-line scheduling on two parallel processors with an upper bound on the items
Semi-on-line scheduling on two parallel processors with an upper bound on the items
2003,
We study a variant of the on-line scheduling problem on two parallel processors. The...
A tutorial for designing flexible geometric algorithms
A tutorial for designing flexible geometric algorithms
2002,
The implementation of an algorithm is faced with the issues of efficiency,...
An online algorithm for the dynamic maximal dense tree problem
An online algorithm for the dynamic maximal dense tree problem
2002,
The Online Maximal Dense Tree problem is as follows: given a weighted directed graph...
Approximations for a bottleneck Steiner tree problem
Approximations for a bottleneck Steiner tree problem
2002,
In the design of wireless communication networks, due to a budget limit, suppose we...
Experimental analysis of heuristic algorithms for the dominating set problem
Experimental analysis of heuristic algorithms for the dominating set problem
2002,
We say a vertex upsilon in a graph G covers a vertex omega if upsilon = omega or if...
Exact and approximation algorithms for clustering
Exact and approximation algorithms for clustering
2002,
In this paper we present an n(O(k1 − 1/d)) -time algorithm for solving the k...
Budget management with applications
Budget management with applications
2002,
Given a directed acyclic graph with timing constraints, the budget management problem...
Swapping a failing edge of a single source shortest paths tree is good and fast
Swapping a failing edge of a single source shortest paths tree is good and fast
2003,
Let G = (V, E) be a 2-edge connected, undirected and nonnegatively weighted graph, and...
Routing flow through a strongly connected graph
Routing flow through a strongly connected graph
2002,
It is shown that, for every strongly connected network in which every edge has...
The analysis of evolutionary algorithms – A proof that crossover really can help
The analysis of evolutionary algorithms – A proof that crossover really can help
2002,
Evolutionary algorithms are randomized search heuristics that were invented in the...
Caching documents with variable sizes and fetching costs: An LP-based approach
Caching documents with variable sizes and fetching costs: An LP-based approach
2002,
We give an integer programming formulation of the paging problem with varying sizes...
Fair versus unrestricted bin packing
Fair versus unrestricted bin packing
2002,
We consider the on-line Dual Bin Packing problem where we have n unit size bins and a...
Linear-time approximation schemes for scheduling malleable parallel tasks
Linear-time approximation schemes for scheduling malleable parallel tasks
2002,
A malleable parallel task is one whose execution time is a function of the number of...
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...
Random sampling of Euler tours
Random sampling of Euler tours
2001,
We define a Markov chain on the set of Euler tours of a given Eulerian graph based on...
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...
Papers per page: