Thursday, May 04, 2006

Linear Scheduling is close to optimal by Darte-Khachiyan-Robert

They handle a URE, not a SURE.
Give the ratio of the best free schedule to the best linear schedule.
Prove that it is small.

Have a definition of fatness.

See the open-problems post.


==

Lattice Stuff:

From Polylib notes

A collection of material on LLL.

material on Reduced lattice bases

Deza's slides talk about the chapters from Schrijver's books.

==

Diestel's Graph theory is available online. Check for some kind of "cycle space", or "reachable cycles"???

polylib notes on polyhedra and lattices.
A good site on convex stuff from upenn.
check Chernikova algorithm by Le Verge!!!!

No comments: