1272 search results - page 57 / 255 » The Set Cover with Pairs Problem |
112
click to vote
COR
2002
15 years 17 days ago
2002
This paper presents the fundamental theory and algorithms for identifying the most preferred alternative for a decision maker (DM) having a non-centrist (or extremist) preferentia...
147
click to vote
LICS
2000
IEEE
15 years 5 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
INFORMATICALT
2006
15 years 22 days ago
2006
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...
99
Voted
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
111
click to vote
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...