David Shmoys - PDFSEARCH.IO - Document Search Engine

David Shmoys
Results: 19

#	Item
1	Primal-Dual Schema for Capacitated Covering Problems? Tim Carnes and David Shmoys Cornell University, Ithaca NY 14853, USA Abstract. Primal-dual algorithms have played an integral role in recent Add to Reading List Source URL: people.orie.cornell.edu - Date: 2012-08-01 14:26:12
2	Maximizing the Spread of Cascades Using Network Design Daniel Sheldon, Bistra Dilkina, Adam N. Elmachtoub, Ryan Finseth, Ashish Sabharwal, Jon Conrad, Carla Gomes, David Shmoys Cornell University, Ithaca, NY William All Add to Reading List Source URL: event.cwi.nl Language: English - Date: 2010-06-18 10:53:38
3	Sponzors DIMATIA Program committee Nikhil Bansal, IBM Watson Research Center Sanjoy Baruah, University of North Carolina Add to Reading List Source URL: iti.mff.cuni.cz Language: English - Date: 2016-02-04 05:53:38 Scheduling Operations research Mathematical optimization Planning Multiprocessor scheduling Flow shop scheduling Interval scheduling Schedule Online algorithm Aging Genetic algorithm David Shmoys
4	CME 305: Discrete Mathematics and Algorithms Instructor: Professor Amin Saberi () Midterm – Problem 1. Show that a graph has a unique minimum spanning tree if, for every cut of the graph, th Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:43:36 Combinatorial optimization Minimum spanning tree Spanning tree Job shop scheduling Maximum flow problem Max-flow min-cut theorem Cut Connectivity David Shmoys Graph theory Mathematics Theoretical computer science
5	C URRICULUM V ITAE David B. Shmoys 231 Rhodes Hall Cornell University Ithaca, NY9146 Add to Reading List Source URL: people.orie.cornell.edu Language: English - Date: 2015-03-17 17:48:30 Computational complexity theory ACM SIGACT Clifford Stein Approximation algorithm Mathematical optimization Algorithm Combinatorial optimization Computer science Edward G. Coffman Jr. Applied mathematics Theoretical computer science Mathematics
6	Real-time Scheduling to Minimize Machine Busy Times∗ Rohit Khandekar† Baruch Schieber ‡ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-11-11 12:04:07 Mathematics Scheduling Theoretical computer science Job shop scheduling Dynamic programming Interval graph Algorithm David Shmoys Multiprocessor scheduling Operations research Mathematical optimization Applied mathematics
7	Advanced Algorithms – COMS31900Lecture 17 Approximation Algorithms (part two) more constant factor approximations Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Mathematics Scheduling Job shop scheduling Mathematical sciences Theoretical computer science Bin packing problem Algorithm Shifting bottleneck heuristic David Shmoys Operations research Applied mathematics Mathematical optimization
8	Multi-processor Scheduling to Minimize Flow Time with Resource Augmentation Chandra Chekuri Ashish Goel ∗ Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2005-08-24 06:29:40 Analysis of algorithms Computational complexity theory Probabilistic complexity theory Randomized algorithm Algorithm Big O notation Job shop scheduling David Shmoys Theoretical computer science Applied mathematics Mathematics
9	Minimizing Average Flow-time : Upper and Lower Bounds Naveen Garg Amit Kumar Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2007-08-30 04:41:30 Operations research Network flow Combinatorial optimization Matching Flow network Linear programming Randomized algorithm Algorithm David Shmoys Mathematics Theoretical computer science Applied mathematics
10	CP 2002 8th International Conference on Principles and Practice of Coloring by Jonathan M. Gomes Selman Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2002-07-31 08:41:54 Geffner Year of birth missing Bart Selman David Shmoys

UPDATE