Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems M. Karpinski OriginalPaper Pages: 386 - 397
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint M. I. Sviridenko OriginalPaper Pages: 398 - 405
Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication Protocols M. SaksS. Zhou OriginalPaper Pages: 418 - 431