Proceedings Of The Seventeenth Annual Acm-siam Symposium On Discrete Algorithms (proceedings In Applied Mathematics)
by Not Available /
2006 / English / DjVu
17.5 MB Download
Symposium held in Miami, Florida, January 22–24, 2006. This symposium is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics. Preface Acknowledgments Session 1A: Confronting Hardness Using a Hybrid Approach, Virginia Vassilevska, Ryan Williams, and Shan Leung Maverick Woo A New Approach to Proving Upper Bounds for MAX-2-SAT, Arist Kojevnikov and Alexander S. Kulikov, Measure and Conquer: A Simple O(20.288n) Independent Set Algorithm, Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch A Polynomial Algorithm to Find an Independent Set of Maximum Weight in a Fork-Free Graph, Vadim V. Lozin and Martin Milanic The Knuth-Yao Quadrangle-Inequality Speedup is a Consequence of Total-Monotonicity...
