Search dblp for Publications

export results for "toc:db/conf/approx/approx2009.bht:"

 download as .bib file

@inproceedings{DBLP:conf/approx/AazamiCJ09,
  author       = {Ashkan Aazami and
                  Joseph Cheriyan and
                  Krishnam Raju Jampani},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Approximation Algorithms and Hardness Results for Packing Element-Disjoint
                  Steiner Trees in Planar Graphs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {1--14},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_1},
  doi          = {10.1007/978-3-642-03685-9\_1},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/AazamiCJ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AggarwalDK09,
  author       = {Ankit Aggarwal and
                  Amit Deshpande and
                  Ravi Kannan},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Adaptive Sampling for k-Means Clustering},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {15--28},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_2},
  doi          = {10.1007/978-3-642-03685-9\_2},
  timestamp    = {Tue, 06 Mar 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/AggarwalDK09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AlonPY09,
  author       = {Noga Alon and
                  Rina Panigrahy and
                  Sergey Yekhanin},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Deterministic Approximation Algorithms for the Nearest Codeword Problem},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {339--351},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_26},
  doi          = {10.1007/978-3-642-03685-9\_26},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/AlonPY09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BarakRRRS09,
  author       = {Boaz Barak and
                  Anup Rao and
                  Ran Raz and
                  Ricky Rosen and
                  Ronen Shaltiel},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Strong Parallel Repetition Theorem for Free Projection Games},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {352--365},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_27},
  doi          = {10.1007/978-3-642-03685-9\_27},
  timestamp    = {Mon, 07 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BarakRRRS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Ben-EliezerHL09,
  author       = {Ido Ben{-}Eliezer and
                  Rani Hod and
                  Shachar Lovett},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Random Low Degree Polynomials are Hard to Approximate},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {366--377},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_28},
  doi          = {10.1007/978-3-642-03685-9\_28},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/Ben-EliezerHL09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Ben-SassonV09,
  author       = {Eli Ben{-}Sasson and
                  Michael Viderman},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Composition of Semi-LTCs by Two-Wise Tensor Products},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {378--391},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_29},
  doi          = {10.1007/978-3-642-03685-9\_29},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/Ben-SassonV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BogdanovQ09,
  author       = {Andrej Bogdanov and
                  Youming Qiao},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {On the Security of Goldreich's One-Way Function},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {392--405},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_30},
  doi          = {10.1007/978-3-642-03685-9\_30},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BogdanovQ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BrubakerV09,
  author       = {S. Charles Brubaker and
                  Santosh S. Vempala},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Random Tensors and Planted Cliques},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {406--419},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_31},
  doi          = {10.1007/978-3-642-03685-9\_31},
  timestamp    = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BrubakerV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CarrollMT09,
  author       = {Douglas E. Carroll and
                  Adam Meyerson and
                  Brian Tagiku},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Approximations for Aligned Coloring and Spillage Minimization in Interval
                  and Chordal Graphs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {29--41},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_3},
  doi          = {10.1007/978-3-642-03685-9\_3},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/CarrollMT09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChandrasekaranDV09,
  author       = {Karthekeyan Chandrasekaran and
                  Amit Deshpande and
                  Santosh S. Vempala},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {420--433},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_32},
  doi          = {10.1007/978-3-642-03685-9\_32},
  timestamp    = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/ChandrasekaranDV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CheboluFMS09,
  author       = {Prasad Chebolu and
                  Alan M. Frieze and
                  P{\'{a}}ll Melsted and
                  Gregory B. Sorkin},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Average-Case Analyses of Vickrey Costs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {434--447},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_33},
  doi          = {10.1007/978-3-642-03685-9\_33},
  timestamp    = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/CheboluFMS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChekuriEK09,
  author       = {Chandra Chekuri and
                  Alina Ene and
                  Nitish Korula},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Unsplittable Flow in Paths and Trees and Column-Restricted Packing
                  Integer Programs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {42--55},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_4},
  doi          = {10.1007/978-3-642-03685-9\_4},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/ChekuriEK09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChekuriG09,
  author       = {Chandra Chekuri and
                  Iftah Gamzu},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Truthful Mechanisms via Greedy Iterative Packing},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {56--69},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_5},
  doi          = {10.1007/978-3-642-03685-9\_5},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/ChekuriG09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Chen09,
  author       = {Victor Chen},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {A Hypergraph Dictatorship Test with Perfect Completeness},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {448--461},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_34},
  doi          = {10.1007/978-3-642-03685-9\_34},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/Chen09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChuzhoyC09,
  author       = {Julia Chuzhoy and
                  Paolo Codenotti},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Resource Minimization Job Scheduling},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {70--83},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_6},
  doi          = {10.1007/978-3-642-03685-9\_6},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/ChuzhoyC09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChuzhoyC09a,
  author       = {Julia Chuzhoy and
                  Paolo Codenotti},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Erratum: Resource Minimization Job Scheduling},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_54},
  doi          = {10.1007/978-3-642-03685-9\_54},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/ChuzhoyC09a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CorreaSV09,
  author       = {Jos{\'{e}} R. Correa and
                  Martin Skutella and
                  Jos{\'{e}} Verschae},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {The Power of Preemption on Unrelated Machines and Applications to
                  Scheduling Orders},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {84--97},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_7},
  doi          = {10.1007/978-3-642-03685-9\_7},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/CorreaSV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DeT09,
  author       = {Anindya De and
                  Luca Trevisan},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Extractors Using Hardness Amplification},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {462--475},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_35},
  doi          = {10.1007/978-3-642-03685-9\_35},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/DeT09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/EfremenkoR09,
  author       = {Klim Efremenko and
                  Omer Reingold},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {How Well Do Random Walks Parallelize?},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {476--489},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_36},
  doi          = {10.1007/978-3-642-03685-9\_36},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/EfremenkoR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/EisenbrandR09,
  author       = {Friedrich Eisenbrand and
                  Thomas Rothvo{\ss}},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {New Hardness Results for Diophantine Approximation},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {98--110},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_8},
  doi          = {10.1007/978-3-642-03685-9\_8},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/EisenbrandR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeIMN09,
  author       = {Uriel Feige and
                  Nicole Immorlica and
                  Vahab S. Mirrokni and
                  Hamid Nazerzadeh},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {{PASS} Approximation},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {111--124},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_9},
  doi          = {10.1007/978-3-642-03685-9\_9},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/FeigeIMN09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FriezeMM09,
  author       = {Alan M. Frieze and
                  P{\'{a}}ll Melsted and
                  Michael Mitzenmacher},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {An Analysis of Random-Walk Cuckoo Hashing},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {490--503},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_37},
  doi          = {10.1007/978-3-642-03685-9\_37},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/FriezeMM09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GeorgiouMT09,
  author       = {Konstantinos Georgiou and
                  Avner Magen and
                  Madhur Tulsiani},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Optimal Sherali-Adams Gaps from Pairwise Independence},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {125--139},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_10},
  doi          = {10.1007/978-3-642-03685-9\_10},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/GeorgiouMT09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GibsonKKV09,
  author       = {Matt Gibson and
                  Gaurav Kanade and
                  Erik Krohn and
                  Kasturi R. Varadarajan},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {An Approximation Scheme for Terrain Guarding},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {140--148},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_11},
  doi          = {10.1007/978-3-642-03685-9\_11},
  timestamp    = {Thu, 01 Mar 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/GibsonKKV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GoldreichKNR09,
  author       = {Oded Goldreich and
                  Michael Krivelevich and
                  Ilan Newman and
                  Eyal Rozenberg},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Hierarchy Theorems for Property Testing},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {504--519},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_38},
  doi          = {10.1007/978-3-642-03685-9\_38},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/GoldreichKNR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GoldreichR09,
  author       = {Oded Goldreich and
                  Dana Ron},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Algorithmic Aspects of Property Testing in the Dense Graphs Model},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {520--533},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_39},
  doi          = {10.1007/978-3-642-03685-9\_39},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/GoldreichR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GrigorescuKS09,
  author       = {Elena Grigorescu and
                  Tali Kaufman and
                  Madhu Sudan},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Succinct Representation of Codes with Applications to Testing},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {534--547},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_40},
  doi          = {10.1007/978-3-642-03685-9\_40},
  timestamp    = {Tue, 14 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/GrigorescuKS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuptaKKS09,
  author       = {Anupam Gupta and
                  Ravishankar Krishnaswamy and
                  Amit Kumar and
                  Danny Segev},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Scheduling with Outliers},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {149--162},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_12},
  doi          = {10.1007/978-3-642-03685-9\_12},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/GuptaKKS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiS09,
  author       = {Venkatesan Guruswami and
                  Ali Kemal Sinop},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Improved Inapproximability Results for Maximum k-Colorable Subgraph},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {163--176},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_13},
  doi          = {10.1007/978-3-642-03685-9\_13},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/GuruswamiS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HarrenS09,
  author       = {Rolf Harren and
                  Rob van Stee},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Improved Absolute Approximation Ratios for Two-Dimensional Packing
                  Problems},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {177--189},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_14},
  doi          = {10.1007/978-3-642-03685-9\_14},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/HarrenS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HarrowL09,
  author       = {Aram W. Harrow and
                  Richard Andrew Low},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Efficient Quantum Tensor Product Expanders and k-Designs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {548--561},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_41},
  doi          = {10.1007/978-3-642-03685-9\_41},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/HarrowL09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/JaffeLM09,
  author       = {Alexander Jaffe and
                  James R. Lee and
                  Mohammad Moharrami},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {On the Optimality of Gluing over Scales},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {190--201},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_15},
  doi          = {10.1007/978-3-642-03685-9\_15},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/JaffeLM09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Jayram09,
  author       = {T. S. Jayram},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Hellinger Strikes Back: {A} Note on the Multi-party Information Complexity
                  of {AND}},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {562--573},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_42},
  doi          = {10.1007/978-3-642-03685-9\_42},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/Jayram09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KhandekarKMS09,
  author       = {Rohit Khandekar and
                  Tracy Kimbrel and
                  Konstantin Makarychev and
                  Maxim Sviridenko},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {On Hardness of Pricing Items for Single-Minded Bidders},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {202--216},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_16},
  doi          = {10.1007/978-3-642-03685-9\_16},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/KhandekarKMS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KinneMS09,
  author       = {Jeff Kinne and
                  Dieter van Melkebeek and
                  Ronen Shaltiel},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Pseudorandom Generators and Typically-Correct Derandomization},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {574--587},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_43},
  doi          = {10.1007/978-3-642-03685-9\_43},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/KinneMS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KlivansLT09,
  author       = {Adam R. Klivans and
                  Philip M. Long and
                  Alex K. Tang},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Baum's Algorithm Learns Intersections of Halfspaces with Respect to
                  Log-Concave Distributions},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {588--600},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_44},
  doi          = {10.1007/978-3-642-03685-9\_44},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/KlivansLT09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KochPSW09,
  author       = {Ronald Koch and
                  Britta Peis and
                  Martin Skutella and
                  Andreas Wiese},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Real-Time Message Routing and Scheduling},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {217--230},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_17},
  doi          = {10.1007/978-3-642-03685-9\_17},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/KochPSW09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KoppartyS09,
  author       = {Swastik Kopparty and
                  Shubhangi Saraf},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Tolerant Linearity Testing and Locally Testable Codes},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {601--614},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_45},
  doi          = {10.1007/978-3-642-03685-9\_45},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/KoppartyS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KortsarzN09,
  author       = {Guy Kortsarz and
                  Zeev Nutov},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Approximating Some Network Design Problems with Node Costs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {231--243},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_18},
  doi          = {10.1007/978-3-642-03685-9\_18},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/KortsarzN09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LeeSV09,
  author       = {Jon Lee and
                  Maxim Sviridenko and
                  Jan Vondr{\'{a}}k},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Submodular Maximization over Multiple Matroids via Generalized Exchange
                  Properties},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {244--257},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_19},
  doi          = {10.1007/978-3-642-03685-9\_19},
  timestamp    = {Mon, 12 Feb 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/LeeSV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LovettRTV09,
  author       = {Shachar Lovett and
                  Omer Reingold and
                  Luca Trevisan and
                  Salil P. Vadhan},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Pseudorandom Bit Generators That Fool Modular Sums},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {615--630},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_46},
  doi          = {10.1007/978-3-642-03685-9\_46},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/LovettRTV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LucierMP09,
  author       = {Brendan Lucier and
                  Michael Molloy and
                  Yuval Peres},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {The Glauber Dynamics for Colourings of Bounded Degree Trees},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {631--645},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_47},
  doi          = {10.1007/978-3-642-03685-9\_47},
  timestamp    = {Thu, 24 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/LucierMP09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MagenM09,
  author       = {Avner Magen and
                  Mohammad Moharrami},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams
                  Hierarchy},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {258--271},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_20},
  doi          = {10.1007/978-3-642-03685-9\_20},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/MagenM09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MatulefORS09,
  author       = {Kevin Matulef and
                  Ryan O'Donnell and
                  Ronitt Rubinfeld and
                  Rocco A. Servedio},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Testing {\(\pm\)}1-weight halfspace},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {646--657},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_48},
  doi          = {10.1007/978-3-642-03685-9\_48},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/MatulefORS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MekaZ09,
  author       = {Raghu Meka and
                  David Zuckerman},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Small-Bias Spaces for Group Products},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {658--672},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_49},
  doi          = {10.1007/978-3-642-03685-9\_49},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/MekaZ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MeyersonT09,
  author       = {Adam Meyerson and
                  Brian Tagiku},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Minimizing Average Shortest Path Distances via Shortcut Edge Addition},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {272--285},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_21},
  doi          = {10.1007/978-3-642-03685-9\_21},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/MeyersonT09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MinderV09,
  author       = {Lorenz Minder and
                  Dan Vilenchik},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Small Clique Detection and Approximate Nash Equilibria},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {673--685},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_50},
  doi          = {10.1007/978-3-642-03685-9\_50},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/MinderV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Nutov09,
  author       = {Zeev Nutov},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Approximating Node-Connectivity Augmentation Problems},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {286--297},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_22},
  doi          = {10.1007/978-3-642-03685-9\_22},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/Nutov09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/PaluchMM09,
  author       = {Katarzyna E. Paluch and
                  Marcin Mucha and
                  Aleksander Madry},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman
                  Problem},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {298--311},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_23},
  doi          = {10.1007/978-3-642-03685-9\_23},
  timestamp    = {Thu, 20 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/PaluchMM09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/PanditPV09,
  author       = {Saurav Pandit and
                  Sriram V. Pemmaraju and
                  Kasturi R. Varadarajan},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Approximation Algorithms for Domatic Partitions of Unit Disk Graphs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {312--325},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_24},
  doi          = {10.1007/978-3-642-03685-9\_24},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/PanditPV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/RonT09,
  author       = {Dana Ron and
                  Gilad Tsur},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Testing Computability by Width Two OBDDs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {686--699},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_51},
  doi          = {10.1007/978-3-642-03685-9\_51},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/RonT09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/RothvossS09,
  author       = {Thomas Rothvo{\ss} and
                  Laura Sanit{\`{a}}},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {On the Complexity of the Asymmetric {VPN} Problem},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {326--338},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_25},
  doi          = {10.1007/978-3-642-03685-9\_25},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/RothvossS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ShpilkaV09,
  author       = {Amir Shpilka and
                  Ilya Volkovich},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Improved Polynomial Identity Testing for Read-Once Formulas},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {700--713},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_52},
  doi          = {10.1007/978-3-642-03685-9\_52},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/ShpilkaV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/TaoV09,
  author       = {Terence Tao and
                  Van H. Vu},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Smooth Analysis of the Condition Number and the Least Singular Value},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {714--737},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_53},
  doi          = {10.1007/978-3-642-03685-9\_53},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/TaoV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2009,
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9},
  doi          = {10.1007/978-3-642-03685-9},
  isbn         = {978-3-642-03684-2},
  timestamp    = {Tue, 21 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/2009.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics