Searching for authors named "Clifford Stein" – sorted by Relevance.
-
A 2 2/3 Superstring Approximation Algorithm
- 06117-1599 Clifford Stein y Dartmouth College Hanover, NH 03755-3510 March 17, 1998 Abstract Given a
- Add To MetaCart
-
A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem
- of Hartford W. Hartford, CT 06117-1599 Clifford Stein y Dartmouth College Hanover, NH 03755-3510 August 15
- Cited by 12 (0 self) – Add To MetaCart
-
Scheduling on a Ring with Unit Capacity Links
- Scheduling on a Ring with Unit Capacity Links Perry Fizzano & Clifford Stein Department
- Cited by 1 (0 self) – Add To MetaCart
-
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem (Extended Abstract)
- ) Cliff Stein # David P. Wagner # Dartmouth College Computer Science Technical Report TR2000-367 May 9
- Cited by 1 (0 self) – Add To MetaCart
-
Approximating the Minimum-Cost Maximum Flow is P-Complete
- Approximating the Minimum-Cost Maximum Flow is P-Complete Clifford Stein Laboratory
- Cited by 1 (0 self) – Add To MetaCart
-
Distributed Job Scheduling in Rings Perry Fizzano
- Science David Karger y MIT Laboratory for Computer Science Clifford Stein z Dartmouth College Department
- Add To MetaCart
-
Distributed Job Scheduling in Rings Perry Fizzano
- of Mathematics and Computer Science David Karger y MIT Laboratory for Computer Science Clifford Stein z
- Add To MetaCart
-
A Parallel Algorithm for Approximating the Minimum Cycle Cover
- Laboratory Harvard University Cambridge, MA Clifford Stein y Laboratory for Computer Science MIT Cambridge
- Add To MetaCart
-
Distributed Job Scheduling in Rings
- of Mathematics and Computer Science David Karger y MIT, Laboratory for Computer Science Clifford Stein z
- Add To MetaCart
-
Approximation Algorithms for Multicommodity Flow and Shop Scheduling Problems
- Approximation Algorithms for Multicommodity Flow and Shop Scheduling Problems by Clifford Stein
- Add To MetaCart

