194 search results - page 23 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
100
Voted
STOC
2004
ACM
16 years 23 days ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
109
click to vote
BMCBI
2007
15 years 14 days ago
2007
Background: In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We h...
124
click to vote
FCT
2007
Springer
15 years 4 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
103
click to vote
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
99
Voted
DAM
2011
14 years 7 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...