Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/conf/approx/approx2008.bht:"
@inproceedings{DBLP:conf/approx/AbrahamsonCS08, author = {Jeff Abrahamson and B{\'{e}}la Csaba and Ali Shokoufandeh}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Optimal Random Matchings on Trees and Applications}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {254--265}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_21}, doi = {10.1007/978-3-540-85363-3\_21}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/AbrahamsonCS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/AdlerH08, author = {Micah Adler and Brent Heeringa}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Approximating Optimal Binary Decision Trees}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {1--9}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_1}, doi = {10.1007/978-3-540-85363-3\_1}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/AdlerH08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/AlonBK08, author = {Noga Alon and Ido Ben{-}Eliezer and Michael Krivelevich}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Small Sample Spaces Cannot Fool Low Degree Polynomials}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {266--275}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_22}, doi = {10.1007/978-3-540-85363-3\_22}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/AlonBK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/ArvindM08, author = {Vikraman Arvind and Partha Mukhopadhyay}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {276--289}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_23}, doi = {10.1007/978-3-540-85363-3\_23}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/ArvindM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/AsadpourFS08, author = {Arash Asadpour and Uriel Feige and Amin Saberi}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Santa Claus Meets Hypergraph Matchings}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {10--20}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_2}, doi = {10.1007/978-3-540-85363-3\_2}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/AsadpourFS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/BadoiuDHSZ08, author = {Mihai Badoiu and Erik D. Demaine and MohammadTaghi Hajiaghayi and Anastasios Sidiropoulos and Morteza Zadimoghaddam}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {21--34}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_3}, doi = {10.1007/978-3-540-85363-3\_3}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/BadoiuDHSZ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Ben-SassonV08, author = {Eli Ben{-}Sasson and Michael Viderman}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Tensor Products of Weakly Smooth Codes Are Robust}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {290--302}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_24}, doi = {10.1007/978-3-540-85363-3\_24}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/Ben-SassonV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/BernasconiPS08, author = {Nicla Bernasconi and Konstantinos Panagiotou and Angelika Steger}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {303--316}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_25}, doi = {10.1007/978-3-540-85363-3\_25}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/BernasconiPS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Blais08, author = {Eric Blais}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Improved Bounds for Testing Juntas}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {317--330}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_26}, doi = {10.1007/978-3-540-85363-3\_26}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/Blais08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/BogdanovMV08, author = {Andrej Bogdanov and Elchanan Mossel and Salil P. Vadhan}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {The Complexity of Distinguishing Markov Random Fields}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {331--342}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_27}, doi = {10.1007/978-3-540-85363-3\_27}, timestamp = {Thu, 01 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/BogdanovMV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/BreslerMS08, author = {Guy Bresler and Elchanan Mossel and Allan Sly}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {343--356}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_28}, doi = {10.1007/978-3-540-85363-3\_28}, timestamp = {Fri, 25 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/approx/BreslerMS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/CardinalL08, author = {Jean Cardinal and Eythan Levy}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Connected Vertex Covers in Dense Graphs}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {35--48}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_4}, doi = {10.1007/978-3-540-85363-3\_4}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/CardinalL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/ChlamtacS08, author = {Eden Chlamtac and Gyanit Singh}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Improved Approximation Guarantees through Higher Levels of {SDP} Hierarchies}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {49--62}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_5}, doi = {10.1007/978-3-540-85363-3\_5}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/ChlamtacS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/ChungV08, author = {Kai{-}Min Chung and Salil P. Vadhan}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Tight Bounds for Hashing Block Sources}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {357--370}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_29}, doi = {10.1007/978-3-540-85363-3\_29}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/ChungV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/DavidPV08, author = {Matei David and Toniann Pitassi and Emanuele Viola}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Improved Separations between Nondeterministic and Randomized Multiparty Communication}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {371--384}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_30}, doi = {10.1007/978-3-540-85363-3\_30}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/DavidPV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/DinhR08, author = {Hang Dinh and Alexander Russell}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {385--401}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_31}, doi = {10.1007/978-3-540-85363-3\_31}, timestamp = {Thu, 01 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/DinhR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/DumitrescuJ08, author = {Adrian Dumitrescu and Minghui Jiang}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Sweeping Points}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {63--76}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_6}, doi = {10.1007/978-3-540-85363-3\_6}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/DumitrescuJ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/FischerLNMY08, author = {Eldar Fischer and Oded Lachish and Ilan Newman and Arie Matsliah and Orly Yahalom}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {On the Query Complexity of Testing Orientations for Being Eulerian}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {402--415}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_32}, doi = {10.1007/978-3-540-85363-3\_32}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/FischerLNMY08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/FurerK08, author = {Martin F{\"{u}}rer and Shiva Prasad Kasiviswanathan}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Approximately Counting Embeddings into Random Graphs}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {416--429}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_33}, doi = {10.1007/978-3-540-85363-3\_33}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/approx/FurerK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/GabizonS08, author = {Ariel Gabizon and Ronen Shaltiel}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Increasing the Output Length of Zero-Error Dispersers}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {430--443}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_34}, doi = {10.1007/978-3-540-85363-3\_34}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/GabizonS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/GuruswamiLW08, author = {Venkatesan Guruswami and James R. Lee and Avi Wigderson}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {444--454}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_35}, doi = {10.1007/978-3-540-85363-3\_35}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/GuruswamiLW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/GuruswamiR08, author = {Venkatesan Guruswami and Prasad Raghavendra}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {77--90}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_7}, doi = {10.1007/978-3-540-85363-3\_7}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/GuruswamiR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/GutfreundR08, author = {Dan Gutfreund and Guy N. Rothblum}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {The Complexity of Local List Decoding}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {455--468}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_36}, doi = {10.1007/978-3-540-85363-3\_36}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/GutfreundR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/GutfreundV08, author = {Dan Gutfreund and Salil P. Vadhan}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Limitations of Hardness vs. Randomness under Uniform Reductions}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {469--482}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_37}, doi = {10.1007/978-3-540-85363-3\_37}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/GutfreundV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/HalmanLS08, author = {Nir Halman and Chung{-}Lun Li and David Simchi{-}Levi}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {91--103}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_8}, doi = {10.1007/978-3-540-85363-3\_8}, timestamp = {Thu, 01 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/HalmanLS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/JacksonLSW08, author = {Jeffrey C. Jackson and Homin K. Lee and Rocco A. Servedio and Andrew Wan}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Learning Random Monotone {DNF}}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {483--497}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_38}, doi = {10.1007/978-3-540-85363-3\_38}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/JacksonLSW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/KargerS08, author = {David R. Karger and Jacob Scott}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean {TSP}}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {104--117}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_9}, doi = {10.1007/978-3-540-85363-3\_9}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/KargerS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/KaufmanLX08, author = {Tali Kaufman and Simon Litsyn and Ning Xie}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Breaking the epsilon-Soundness Bound of the Linearity Test over {GF(2)}}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {498--511}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_39}, doi = {10.1007/978-3-540-85363-3\_39}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/KaufmanLX08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/KortsarzLN08, author = {Guy Kortsarz and Michael Langberg and Zeev Nutov}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Approximating Maximum Subgraphs without Short Cycles}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {118--131}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_10}, doi = {10.1007/978-3-540-85363-3\_10}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/KortsarzLN08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/KowalikM08, author = {Lukasz Kowalik and Marcin Mucha}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Deterministic 7/8-Approximation for the Metric Maximum {TSP}}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {132--145}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_11}, doi = {10.1007/978-3-540-85363-3\_11}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/KowalikM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/LandoN08, author = {Yuval Lando and Zeev Nutov}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Inapproximability of Survivable Networks}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {146--152}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_12}, doi = {10.1007/978-3-540-85363-3\_12}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/LandoN08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/LibertyAS08, author = {Edo Liberty and Nir Ailon and Amit Singer}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Dense Fast Random Projections and Lean Walsh Transforms}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {512--522}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_40}, doi = {10.1007/978-3-540-85363-3\_40}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/LibertyAS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/MagenZ08, author = {Avner Magen and Anastasios Zouzias}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Near Optimal Dimensionality Reductions That Preserve Volumes}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {523--534}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_41}, doi = {10.1007/978-3-540-85363-3\_41}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/MagenZ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/MastrolilliMS08, author = {Monaldo Mastrolilli and Nikolaus Mutsanas and Ola Svensson}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Approximating Single Machine Scheduling with Scenarios}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {153--164}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_13}, doi = {10.1007/978-3-540-85363-3\_13}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/MastrolilliMS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/McCutchenK08, author = {Richard Matthew McCutchen and Samir Khuller}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {165--178}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_14}, doi = {10.1007/978-3-540-85363-3\_14}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/McCutchenK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/MittalS08, author = {Shashi Mittal and Andreas S. Schulz}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {179--192}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_15}, doi = {10.1007/978-3-540-85363-3\_15}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/MittalS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/NagarajanR08, author = {Viswanath Nagarajan and R. Ravi}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {The Directed Minimum Latency Problem}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {193--206}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_16}, doi = {10.1007/978-3-540-85363-3\_16}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/NagarajanR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/NarayananN08, author = {Hariharan Narayanan and Partha Niyogi}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Sampling Hypersurfaces through Diffusion}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {535--548}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_42}, doi = {10.1007/978-3-540-85363-3\_42}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/NarayananN08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Nguyen08, author = {Th{\`{a}}nh Nguyen}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {A Simple {LP} Relaxation for the Asymmetric Traveling Salesman Problem}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {207--218}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_17}, doi = {10.1007/978-3-540-85363-3\_17}, timestamp = {Fri, 06 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/Nguyen08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Nutov08, author = {Zeev Nutov}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Approximating Directed Weighted-Degree Constrained Networks}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {219--232}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_18}, doi = {10.1007/978-3-540-85363-3\_18}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/Nutov08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Rao08, author = {Anup Rao}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {A 2-Source Almost-Extractor for Linear Entropy}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {549--556}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_43}, doi = {10.1007/978-3-540-85363-3\_43}, timestamp = {Thu, 03 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/Rao08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/RaoZ08, author = {Anup Rao and David Zuckerman}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Extractors for Three Uneven-Length Sources}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {557--570}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_44}, doi = {10.1007/978-3-540-85363-3\_44}, timestamp = {Mon, 07 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/RaoZ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/SafariS08, author = {MohammadAli Safari and Mohammad R. Salavatipour}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {233--246}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_19}, doi = {10.1007/978-3-540-85363-3\_19}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/SafariS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Sorkin08, author = {Gregory B. Sorkin}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {The Power of Choice in a Generalized P{\'{o}}lya Urn Model}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {571--583}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_45}, doi = {10.1007/978-3-540-85363-3\_45}, timestamp = {Sat, 16 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/Sorkin08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Srinivasan08, author = {Aravind Srinivasan}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Budgeted Allocations in the Full-Information Setting}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {247--253}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_20}, doi = {10.1007/978-3-540-85363-3\_20}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/Srinivasan08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Woodruff08, author = {David P. Woodruff}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Corruption and Recovery-Efficient Locally Decodable Codes}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {584--595}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_46}, doi = {10.1007/978-3-540-85363-3\_46}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/Woodruff08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Yuster08, author = {Raphael Yuster}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {596--601}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_47}, doi = {10.1007/978-3-540-85363-3\_47}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/Yuster08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/approx/2008, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3}, doi = {10.1007/978-3-540-85363-3}, isbn = {978-3-540-85362-6}, timestamp = {Tue, 21 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/2008.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.