3874 search results - page 556 / 775 » Approximation Algorithms for k-hurdle Problems |
139
click to vote
RECOMB
2008
Springer
16 years 4 months ago
2008
Springer
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...
147
click to vote
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
Refereed conferences require every submission to be reviewed by members of a program committee (PC) in charge of selecting the conference program. There are many software packages...
126
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
111
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
116
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...