194 search results - page 5 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant...
ICPR
2002
IEEE
14 years 6 months ago
2002
IEEE
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
DISOPT
2010
13 years 5 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
ESA
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...