We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byColleen Blan
Modified over 2 years ago
On the number of matroids Nikhil Bansal (TU Eindhoven) Rudi Pendavingh (TU Eindhoven) Jorn van der Pol (TU Eindhoven)
Narrowing the gap m(n) Better bound
Outline Knuth’s lower bound construction Counting stable sets The final upper bound
Knuth’s Lower bound
Rest of the talk
Rest of the talk Encoding for independent sets. Encoding for Matroids.
A useful lemma A
Encoding a stable set S G I A
Phases: d 1 2 d-1 …
Narrowing the gap
Knuth’s Lower bound B B B’
Phase Difference = Phase Difference = 0.05.
10-1 人生与责任 淮安工业园区实验学校 连芳芳 “ 自我介绍 ” “ 自我介绍 ” 儿童时期的我.
Discrepancy and SDPs Nikhil Bansal (TU Eindhoven, Netherlands ) August 24, ISMP 2012, Berlin.
N. Bansal 1, M. Charikar 2, R. Krishnaswamy 2, S. Li 3 1 TU Eindhoven 2 Princeton University 3 TTIC Midwest Theory Day, Purdue, May 3, 2014.
1/17 Deterministic Discrepancy Minimization Nikhil Bansal (TU Eindhoven) Joel Spencer (NYU)
1/26 Constructive Algorithms for Discrepancy Minimization Nikhil Bansal (IBM)
Application of Perturbation Methods to Approximate the Solutions to Static and Non-linear Oscillatory Problems FINAL.
Xiaoming Sun Tsinghua University David Woodruff MIT
A polylog competitive algorithm for the k-server problem Nikhil Bansal (Eindhoven) Niv Buchbinder (Open Univ., Israel) Aleksander Madry (MIT) Seffi Naor.
Sorting 1. Insertion Sort
Bounds Bingo!. Pick any 9 of these numbers
Determining the intervals (official procedure!): 1.Decide on the number of classes – typically between 5 and 15 2.Determine class width: range / # of.
1 Approximation Algorithms for Generalized Scheduling Problems Ravishankar Krishnaswamy Carnegie Mellon University joint work with Nikhil Bansal, Anupam.
Modeling BiOS? Why not.. Renzo Mosetti OGS. Main question: Is the pseudo-periodic reversal of the circulation in the Ionian sustainable only through internal.
Windows Scheduling Problems for Broadcast System 1 Amotz Bar-Noy, and Richard E. Ladner Presented by Qiaosheng Shi.
Lecture 3 Sorting and Selection. Comparison Sort.
Frequency Distributions and Their Graphs Section 2.1.
Approximation Algorithms for Capacitated Set Cover Ravishankar Krishnaswamy (joint work with Nikhil Bansal and Barna Saha)
© 2017 SlidePlayer.com Inc. All rights reserved.