Sciweavers

503 search results - page 15 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
JDA
2007
62views more  JDA 2007»
14 years 9 months ago
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
In this paper, we deal with the maximum integer multiflow and the minimum multicut problems in rectilinear grid graphs with uniform capacities on the edges. The first problem is...
Cédric Bentz, Marie-Christine Costa, Fr&eac...
RECOMB
2010
Springer
14 years 8 months ago
An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
Aïda Ouangraoua, Krister M. Swenson, Cedric C...
SODA
1992
ACM
135views Algorithms» more  SODA 1992»
14 years 10 months ago
Applications of Parametric Searching in Geometric Optimization
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
Pankaj K. Agarwal, Micha Sharir, Sivan Toledo
JCO
2010
123views more  JCO 2010»
14 years 8 months ago
Capacity inverse minimum cost flow problem
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...
Çigdem Güler, Horst W. Hamacher
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
15 years 2 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng