1871 search results - page 38 / 375 » The Ephemeral Pairing Problem |
IWPEC
2009
Springer
15 years 5 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...
IWPEC
2004
Springer
15 years 4 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...
HM
2007
Springer
15 years 5 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 ...
105
click to vote
CP
1999
Springer
15 years 3 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...
111
click to vote
ECAI
2010
Springer
14 years 9 months ago
2010
Springer
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...