Sciweavers

CIAC
2006
Springer
160views Algorithms» more  CIAC 2006»
14 years 4 months ago
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
Ming-Yang Kao, Manan Sanghi
CIAC
2006
Springer
81views Algorithms» more  CIAC 2006»
14 years 4 months ago
Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines
Yvonne Bleischwitz, Burkhard Monien
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
14 years 4 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos
CIAC
2006
Springer
79views Algorithms» more  CIAC 2006»
14 years 4 months ago
Matching Subsequences in Trees
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
Philip Bille, Inge Li Gørtz
CIAC
2006
Springer
76views Algorithms» more  CIAC 2006»
14 years 4 months ago
Gathering Algorithms on Paths Under Interference Constraints
Jean-Claude Bermond, Ricardo C. Corrêa, Min-...
CIAC
2006
Springer
69views Algorithms» more  CIAC 2006»
14 years 4 months ago
The Linear Arrangement Problem Parameterized Above Guaranteed Value
Gregory Gutin, Arash Rafiey, Stefan Szeider, Ander...
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
14 years 4 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...