Randomized rounding

Results: 58



#Item
1Advanced Approximation Algorithms  (CMU 18-854B, SpringLecture 2: LP Relaxations, Randomized Rounding Jan 17, 2008

Advanced Approximation Algorithms (CMU 18-854B, SpringLecture 2: LP Relaxations, Randomized Rounding Jan 17, 2008

Add to Reading List

Source URL: www.cs.cmu.edu

- Date: 2008-01-21 16:09:45
    2Iterative Randomized Rounding Thomas Rothvoß Department of Mathematics, M.I.T. Carg`ese 2011 Joint work with Jaroslaw Byrka,

    Iterative Randomized Rounding Thomas Rothvoß Department of Mathematics, M.I.T. Carg`ese 2011 Joint work with Jaroslaw Byrka,

    Add to Reading List

    Source URL: www.math.washington.edu

    - Date: 2013-11-01 17:11:36
      3arXiv:1110.4319v2  [cs.DS]  20 Oct 2011

      arXiv:1110.4319v2 [cs.DS] 20 Oct 2011

      Add to Reading List

      Source URL: arxiv.org

      Language: English - Date: 2011-10-20 20:42:54
      4The Entropy Rounding Method in Approximation Algorithms Thomas Rothvoß Department of Mathematics, M.I.T.  Carg`ese 2011

      The Entropy Rounding Method in Approximation Algorithms Thomas Rothvoß Department of Mathematics, M.I.T. Carg`ese 2011

      Add to Reading List

      Source URL: www.math.washington.edu

      Language: English - Date: 2013-11-01 17:11:36
      5Unifying Local Consistency and MAX SAT Relaxations for Scalable Inference with Rounding Guarantees Stephen H. Bach University of Maryland

      Unifying Local Consistency and MAX SAT Relaxations for Scalable Inference with Rounding Guarantees Stephen H. Bach University of Maryland

      Add to Reading List

      Source URL: stephenbach.net

      Language: English - Date: 2015-01-26 18:37:33
      6CS264: Beyond Worst-Case Analysis Lecture #20: From Unknown Input Distributions to Instance Optimality∗ Tim Roughgarden† December 3, 2014

      CS264: Beyond Worst-Case Analysis Lecture #20: From Unknown Input Distributions to Instance Optimality∗ Tim Roughgarden† December 3, 2014

      Add to Reading List

      Source URL: theory.stanford.edu

      Language: English - Date: 2014-12-29 00:22:18
      7From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡

      From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡

      Add to Reading List

      Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com

      Language: English - Date: 2012-07-04 18:28:36
      8CS364B: Frontiers in Mechanism Design Lecture #8: MIR and MIDR Mechanisms∗ Tim Roughgarden† January 29,

      CS364B: Frontiers in Mechanism Design Lecture #8: MIR and MIDR Mechanisms∗ Tim Roughgarden† January 29,

      Add to Reading List

      Source URL: theory.stanford.edu

      Language: English - Date: 2014-02-19 21:14:11
      9CS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding∗ Tim Roughgarden† February 5, 2014

      CS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding∗ Tim Roughgarden† February 5, 2014

      Add to Reading List

      Source URL: theory.stanford.edu

      Language: English - Date: 2014-06-11 16:25:54
      10Algorithmic Game Theory  Summer 2015, Week 9 Truthful Multi-Parameter Mechanisms and Black-Box Reductions

      Algorithmic Game Theory Summer 2015, Week 9 Truthful Multi-Parameter Mechanisms and Black-Box Reductions

      Add to Reading List

      Source URL: www.cadmo.ethz.ch

      Language: English - Date: 2016-01-25 09:13:39