Abstract is missing.
- Approximating Optimal Binary Decision TreesMicah Adler, Brent Heeringa. 1-9 [doi]
- Santa Claus Meets Hypergraph MatchingsArash Asadpour, Uriel Feige, Amin Saberi. 10-20 [doi]
- Ordinal Embedding: Approximation Algorithms and Dimensionality ReductionMihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam. 21-34 [doi]
- Connected Vertex Covers in Dense GraphsJean Cardinal, Eythan Levy. 35-48 [doi]
- Improved Approximation Guarantees through Higher Levels of SDP HierarchiesEden Chlamtac, Gyanit Singh. 49-62 [doi]
- Sweeping PointsAdrian Dumitrescu, Minghui Jiang. 63-76 [doi]
- Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games HardnessVenkatesan Guruswami, Prasad Raghavendra. 77-90 [doi]
- Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project NetworksNir Halman, Chung-Lun Li, David Simchi-Levi. 91-103 [doi]
- Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSPDavid R. Karger, Jacob Scott. 104-117 [doi]
- Approximating Maximum Subgraphs without Short CyclesGuy Kortsarz, Michael Langberg, Zeev Nutov. 118-131 [doi]
- Deterministic 7/8-Approximation for the Metric Maximum TSPLukasz Kowalik, Marcin Mucha. 132-145 [doi]
- Inapproximability of Survivable NetworksYuval Lando, Zeev Nutov. 146-152 [doi]
- Approximating Single Machine Scheduling with ScenariosMonaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson. 153-164 [doi]
- Streaming Algorithms for k-Center Clustering with Outliers and with AnonymityRichard Matthew McCutchen, Samir Khuller. 165-178 [doi]
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into OneShashi Mittal, Andreas S. Schulz. 179-192 [doi]
- The Directed Minimum Latency ProblemViswanath Nagarajan, R. Ravi. 193-206 [doi]
- A Simple LP Relaxation for the Asymmetric Traveling Salesman ProblemThành Nguyen. 207-218 [doi]
- Approximating Directed Weighted-Degree Constrained NetworksZeev Nutov. 219-232 [doi]
- A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric CostsMohammadAli Safari, Mohammad R. Salavatipour. 233-246 [doi]
- Budgeted Allocations in the Full-Information SettingAravind Srinivasan. 247-253 [doi]
- Optimal Random Matchings on Trees and ApplicationsJeff Abrahamson, Béla Csaba, Ali Shokoufandeh. 254-265 [doi]
- Small Sample Spaces Cannot Fool Low Degree PolynomialsNoga Alon, Ido Ben-Eliezer, Michael Krivelevich. 266-275 [doi]
- Derandomizing the Isolation Lemma and Lower Bounds for Circuit SizeVikraman Arvind, Partha Mukhopadhyay. 276-289 [doi]
- Tensor Products of Weakly Smooth Codes Are RobustEli Ben-Sasson, Michael Viderman. 290-302 [doi]
- On the Degree Sequences of Random Outerplanar and Series-Parallel GraphsNicla Bernasconi, Konstantinos Panagiotou, Angelika Steger. 303-316 [doi]
- Improved Bounds for Testing JuntasEric Blais. 317-330 [doi]
- The Complexity of Distinguishing Markov Random FieldsAndrej Bogdanov, Elchanan Mossel, Salil P. Vadhan. 331-342 [doi]
- Reconstruction of Markov Random Fields from Samples: Some Observations and AlgorithmsGuy Bresler, Elchanan Mossel, Allan Sly. 343-356 [doi]
- Tight Bounds for Hashing Block SourcesKai-Min Chung, Salil P. Vadhan. 357-370 [doi]
- Improved Separations between Nondeterministic and Randomized Multiparty CommunicationMatei David, Toniann Pitassi, Emanuele Viola. 371-384 [doi]
- Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive GraphsHang Dinh, Alexander Russell. 385-401 [doi]
- On the Query Complexity of Testing Orientations for Being EulerianEldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom. 402-415 [doi]
- Approximately Counting Embeddings into Random GraphsMartin Fürer, Shiva Prasad Kasiviswanathan. 416-429 [doi]
- Increasing the Output Length of Zero-Error DispersersAriel Gabizon, Ronen Shaltiel. 430-443 [doi]
- Euclidean Sections of with Sublinear Randomness and Error-Correction over the RealsVenkatesan Guruswami, James R. Lee, Avi Wigderson. 444-454 [doi]
- The Complexity of Local List DecodingDan Gutfreund, Guy N. Rothblum. 455-468 [doi]
- Limitations of Hardness vs. Randomness under Uniform ReductionsDan Gutfreund, Salil P. Vadhan. 469-482 [doi]
- Learning Random Monotone DNFJeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan. 483-497 [doi]
- Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2)Tali Kaufman, Simon Litsyn, Ning Xie. 498-511 [doi]
- Dense Fast Random Projections and Lean Walsh TransformsEdo Liberty, Nir Ailon, Amit Singer. 512-522 [doi]
- Near Optimal Dimensionality Reductions That Preserve VolumesAvner Magen, Anastasios Zouzias. 523-534 [doi]
- Sampling Hypersurfaces through DiffusionHariharan Narayanan, Partha Niyogi. 535-548 [doi]
- A 2-Source Almost-Extractor for Linear EntropyAnup Rao. 549-556 [doi]
- Extractors for Three Uneven-Length SourcesAnup Rao, David Zuckerman. 557-570 [doi]
- The Power of Choice in a Generalized Pólya Urn ModelGregory B. Sorkin. 571-583 [doi]
- Corruption and Recovery-Efficient Locally Decodable CodesDavid P. Woodruff. 584-595 [doi]
- Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large SetsRaphael Yuster. 596-601 [doi]