Search Sciweavers | Sciweavers

Sorting permutations by transpositions is an important and difficult problem in genome rearrangements. The transposition diameter TD(n) is the maximum transposition distance among ...

Linyuan Lu, Yiting Yang

claim paper

Read More »

157

click to vote

CORR
2011
Springer

180views Education» more CORR 2011»

Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines

14 years 10 months ago

Download www.cs.dartmouth.edu

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...

Lisa Fleischer, Zhenghui Wang

claim paper

Read More »

102

click to vote

CORR
2011
Springer

89views Education» more CORR 2011»

Tensor Rank: Some Lower and Upper Bounds

14 years 10 months ago

Download www.math.princeton.edu

Boris Alexeev, Michael Forbes, Jacob Tsimerman

claim paper