1 SSA: A Power and Memory Efficient Scheme to Multi-Match Packet Classification Fang Yu 1 T. V. Lakshman 2 Marti Austin Motoyama 1 Randy H. Katz 1 1 EECS.
How to Round Any CSP Prasad Raghavendra University of Washington, Seattle David Steurer, Princeton University (In Principle)
Approximating NP-hard Problems Efficient Algorithms and their Limits Prasad Raghavendra University of Washington Seattle.
Prasad Raghavendra University of Washington Seattle Optimal Algorithms and Inapproximability Results for Every CSP?
Organizing Open Online Computational Problem Solving Competitions By: Ahmed Abdelmeged.
Heuristic Optimization Athens 2004 Department of Architecture and Technology Universidad Politécnica de Madrid Víctor Robles [email protected].
Organizing Open Online Computational Problem Solving Competitions
Optimal Algorithms and Inapproximability Results for Every CSP?