3415 search results - page 104 / 683 » Lower Bounds for Kernelizations |
INFORMS
2011
14 years 11 months ago
2011
110
click to vote
SIAMDM
2010
14 years 11 months ago
2010
Sorting permutations by transpositions is an important and difficult problem in genome rearrangements. The transposition diameter TD(n) is the maximum transposition distance among ...
132
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...