2654 search results - page 100 / 531 » On Pairing Inversion Problems |
134
click to vote
INFORMATICALT
2006
15 years 4 months 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...
133
click to vote
IWPEC
2009
Springer
15 years 11 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...
127
click to vote
IWPEC
2004
Springer
15 years 10 months ago
2004
Springer
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k ve...
134
click to vote
HM
2007
Springer
15 years 10 months ago
2007
Springer
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
149
click to vote
CP
1999
Springer
15 years 9 months ago
1999
Springer
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge...