172 search results - page 16 / 35 » Improved approximation for directed cut problems |
AAIM
2010
Springer
15 years 1 months ago
2010
Springer
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
JCSS
2008
14 years 9 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
106
click to vote
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
WSC
2004
14 years 11 months ago
2004
In time-parallel simulation, the simulation time axis is decomposed into a number of slices which are assigned to parallel processes for concurrent simulation. Although a promisin...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...