Sciweavers

7930 search results - page 1223 / 1586
» Greedy in Approximation Algorithms
Sort
View
CPM
2000
Springer
105views Combinatorics» more  CPM 2000»
15 years 11 months ago
Structural Properties and Tractability Results for Linear Synteny
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
David Liben-Nowell, Jon M. Kleinberg
FOCS
1998
IEEE
15 years 11 months ago
The Finite Capacity Dial-A-Ride Problem
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
Moses Charikar, Balaji Raghavachari
IPPS
1998
IEEE
15 years 11 months ago
Multicasting and Broadcasting in Large WDM Networks
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
Weifa Liang, Hong Shen
FOCS
1997
IEEE
15 years 11 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
PPSN
1998
Springer
15 years 11 months ago
A Spatial Predator-Prey Approach to Multi-objective Optimization: A Preliminary Study
This paper presents a novel evolutionary approach of approximating the shape of the Pareto-optimal set of multi-objective optimization problems. The evolutionary algorithm (EA) use...
Marco Laumanns, Günter Rudolph, Hans-Paul Sch...
« Prev « First page 1223 / 1586 Last » Next »