David Shmoys

Results: 19



#Item
1Primal-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

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
    2Maximizing 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

    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
      3Sponzors DIMATIA Program committee Nikhil Bansal, IBM Watson Research Center Sanjoy Baruah, University of North Carolina

      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
      4CME 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

      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
      5C URRICULUM V ITAE David B. Shmoys 231 Rhodes Hall Cornell University Ithaca, NY9146

      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
      6Real-time Scheduling to Minimize Machine Busy Times∗ Rohit Khandekar† Baruch Schieber ‡

      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
      7Advanced Algorithms – COMS31900Lecture 17 Approximation Algorithms (part two) more constant factor approximations

      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
      8Multi-processor Scheduling to Minimize Flow Time with  Resource Augmentation Chandra Chekuri Ashish Goel ∗

      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
      9Minimizing Average Flow-time : Upper and Lower Bounds Naveen Garg Amit Kumar

      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
      10CP 2002 8th International Conference on Principles and Practice of Coloring by Jonathan M. Gomes Selman

      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