1158 search results - page 27 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
DAGSTUHL
2007
15 years 15 days ago
2007
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
AAIM
2010
Springer
15 years 2 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...
WWW
2008
ACM
15 years 11 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
89
Voted
STOC
2005
ACM
15 years 11 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
107
click to vote
ALGORITHMICA
2011
14 years 6 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...