Journal: Journal of Algorithms

Found 6 papers in total
An (8)-(13)-approximation algorithm for the asymmetric maximum Traveling Salesperson Problem
An (8)-(13)-approximation algorithm for the asymmetric maximum Traveling Salesperson Problem
2004,
We present a polynomial time approximation algorithm for the asymmetric maximum...
Broadcast scheduling optimization for heterogeneous cluster systems
Broadcast scheduling optimization for heterogeneous cluster systems
2002,
Networks of workstations (NOWs) offer a cost-effective alternative to massively...
The 2-center problem with obstacles
The 2-center problem with obstacles
2002,
Given a set S of n points in the plane and a set 0 of pairwise disjoint simple...
Approximation algorithms for scheduling arithmetic expression on pipelined machines
Approximation algorithms for scheduling arithmetic expression on pipelined machines
1989,
Consider a processor which can issue one instruction every machine cycle, but can use...
The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
1989,
An algorithm is presented for finding a Hamiltonian cycle in 4-connected planar...
The parallel complexity of TSP Heuristics
The parallel complexity of TSP Heuristics
1989,
The authors consider eight heuristics for constructing approximate solutions to the...
Papers per page: