Sciweavers

22 search results - page 5 / 5
» Better Time-Space Lower Bounds for SAT and Related Problems
Sort
View
99
Voted
SPAA
2009
ACM
16 years 5 days ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
MP
2002
85views more  MP 2002»
14 years 11 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman