Search dblp for Publications

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

 download as .bib file

@inproceedings{DBLP:conf/approx/AbdullahCD11,
  author       = {Mohammed Amin Abdullah and
                  Colin Cooper and
                  Moez Draief},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Viral Processes by Random Walks on Random Regular Graphs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {351--364},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_30},
  doi          = {10.1007/978-3-642-22935-0\_30},
  timestamp    = {Wed, 09 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/AbdullahCD11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AmbainisCL11,
  author       = {Andris Ambainis and
                  Andrew M. Childs and
                  Yi{-}Kai Liu},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Quantum Property Testing for Bounded-Degree Graphs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {365--376},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_31},
  doi          = {10.1007/978-3-642-22935-0\_31},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/AmbainisCL11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AroraG11,
  author       = {Sanjeev Arora and
                  Rong Ge},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {New Tools for Graph Coloring},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {1--12},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_1},
  doi          = {10.1007/978-3-642-22935-0\_1},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/AroraG11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ArtemenkoS11,
  author       = {Sergei Artemenko and
                  Ronen Shaltiel},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions
                  Showing Hardness Amplification},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {377--388},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_32},
  doi          = {10.1007/978-3-642-22935-0\_32},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/ArtemenkoS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AustrinBC11,
  author       = {Per Austrin and
                  Mark Braverman and
                  Eden Chlamtac},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Inapproximability of NP-Complete Variants of Nash Equilibrium},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {13--25},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_2},
  doi          = {10.1007/978-3-642-22935-0\_2},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/AustrinBC11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AvigadG11,
  author       = {Lidor Avigad and
                  Oded Goldreich},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Testing Graph Blow-Up},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {389--399},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_33},
  doi          = {10.1007/978-3-642-22935-0\_33},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/AvigadG11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BaI11,
  author       = {Khanh Do Ba and
                  Piotr Indyk},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Sparse Recovery with Partial Support Knowledge},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {26--37},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_3},
  doi          = {10.1007/978-3-642-22935-0\_3},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BaI11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BansalKS11,
  author       = {Nikhil Bansal and
                  Ravishankar Krishnaswamy and
                  Barna Saha},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {On Capacitated Set Cover Problems},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {38--49},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_4},
  doi          = {10.1007/978-3-642-22935-0\_4},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/BansalKS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BartalCMN11,
  author       = {Yair Bartal and
                  Douglas E. Carroll and
                  Adam Meyerson and
                  Ofer Neiman},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Bandwidth and Low Dimensional Embedding},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {50--61},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_5},
  doi          = {10.1007/978-3-642-22935-0\_5},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BartalCMN11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Ben-SassonGMSS11,
  author       = {Eli Ben{-}Sasson and
                  Elena Grigorescu and
                  Ghid Maatouk and
                  Amir Shpilka and
                  Madhu Sudan},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {On Sums of Locally Testable Affine Invariant Properties},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {400--411},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_34},
  doi          = {10.1007/978-3-642-22935-0\_34},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/Ben-SassonGMSS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Ben-SassonS11,
  author       = {Eli Ben{-}Sasson and
                  Madhu Sudan},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Limits on the Rate of Locally Testable Affine-Invariant Codes},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {412--423},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_35},
  doi          = {10.1007/978-3-642-22935-0\_35},
  timestamp    = {Tue, 14 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/Ben-SassonS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BermanDZ11,
  author       = {Piotr Berman and
                  Erik D. Demaine and
                  Morteza Zadimoghaddam},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {O(1)-Approximations for Maximum Movement Problems},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {62--74},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_6},
  doi          = {10.1007/978-3-642-22935-0\_6},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BermanDZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BhalgatCK11,
  author       = {Anand Bhalgat and
                  Deeparnab Chakrabarty and
                  Sanjeev Khanna},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Optimal Lower Bounds for Universal and Differentially Private Steiner
                  Trees and TSPs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {75--86},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_7},
  doi          = {10.1007/978-3-642-22935-0\_7},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BhalgatCK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BhalgatCK11a,
  author       = {Anand Bhalgat and
                  Deeparnab Chakrabarty and
                  Sanjeev Khanna},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Social Welfare in One-Sided Matching Markets without Money},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {87--98},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_8},
  doi          = {10.1007/978-3-642-22935-0\_8},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BhalgatCK11a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BhatnagarBM11,
  author       = {Nayantara Bhatnagar and
                  Andrej Bogdanov and
                  Elchanan Mossel},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {The Computational Complexity of Estimating {MCMC} Convergence Time},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {424--435},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_36},
  doi          = {10.1007/978-3-642-22935-0\_36},
  timestamp    = {Thu, 01 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BhatnagarBM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BrodyW11,
  author       = {Joshua Brody and
                  David P. Woodruff},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Streaming Algorithms with One-Sided Estimation},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {436--447},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_37},
  doi          = {10.1007/978-3-642-22935-0\_37},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BrodyW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CarnesS11,
  author       = {Tim Carnes and
                  David B. Shmoys},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing
                  Problem},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {99--110},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_9},
  doi          = {10.1007/978-3-642-22935-0\_9},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/CarnesS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChakaravarthyKPRS11,
  author       = {Venkatesan T. Chakaravarthy and
                  Amit Kumar and
                  Vinayaka Pandit and
                  Sambuddha Roy and
                  Yogish Sabharwal},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Scheduling Resources for Throughput Maximization},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {111--122},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_10},
  doi          = {10.1007/978-3-642-22935-0\_10},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/ChakaravarthyKPRS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChakrabartiK11,
  author       = {Amit Chakrabarti and
                  Ranganath Kondapally},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Everywhere-Tight Information Cost Tradeoffs for Augmented Index},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {448--459},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_38},
  doi          = {10.1007/978-3-642-22935-0\_38},
  timestamp    = {Thu, 01 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/ChakrabartiK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Chalermsook11,
  author       = {Parinya Chalermsook},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Coloring and Maximum Independent Set of Rectangles},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {123--134},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_11},
  doi          = {10.1007/978-3-642-22935-0\_11},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/Chalermsook11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CheungS11,
  author       = {Maurice Cheung and
                  David B. Shmoys},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling
                  Problems},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {135--146},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_12},
  doi          = {10.1007/978-3-642-22935-0\_12},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/CheungS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CohenN11,
  author       = {Nachshon Cohen and
                  Zeev Nutov},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {A {(1} + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity
                  Augmentation of Trees with Constant Radius},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {147--157},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_13},
  doi          = {10.1007/978-3-642-22935-0\_13},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/CohenN11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CrouchM11,
  author       = {Michael S. Crouch and
                  Andrew McGregor},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Periodicity and Cyclic Shifts via Linear Sketches},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {158--170},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_14},
  doi          = {10.1007/978-3-642-22935-0\_14},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/CrouchM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Dachman-SoledS11,
  author       = {Dana Dachman{-}Soled and
                  Rocco A. Servedio},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {A Canonical Form for Testing Boolean Function Properties},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {460--471},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_39},
  doi          = {10.1007/978-3-642-22935-0\_39},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/Dachman-SoledS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DaniM11,
  author       = {Varsha Dani and
                  Cristopher Moore},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Independent Sets in Random Graphs from the Weighted Second Moment
                  Method},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {472--482},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_40},
  doi          = {10.1007/978-3-642-22935-0\_40},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/DaniM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DeW11,
  author       = {Anindya De and
                  Thomas Watson},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Extractors and Lower Bounds for Locally Samplable Sources},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {483--494},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_41},
  doi          = {10.1007/978-3-642-22935-0\_41},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/DeW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DellamonicaKMRS11,
  author       = {Domingos Dellamonica Jr. and
                  Subrahmanyam Kalyanasundaram and
                  Daniel M. Martin and
                  Vojtech R{\"{o}}dl and
                  Asaf Shapira},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {495--506},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_42},
  doi          = {10.1007/978-3-642-22935-0\_42},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/DellamonicaKMRS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DinurK11,
  author       = {Irit Dinur and
                  Tali Kaufman},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Dense Locally Testable Codes Cannot Have Constant Rate and Distance},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {507--518},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_43},
  doi          = {10.1007/978-3-642-22935-0\_43},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/DinurK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DraganK11,
  author       = {Feodor F. Dragan and
                  Ekkehard K{\"{o}}hler},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted
                  Graphs via Generalized Chordal Graphs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {171--183},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_15},
  doi          = {10.1007/978-3-642-22935-0\_15},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/DraganK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Drucker11,
  author       = {Andrew Drucker},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Efficient Probabilistically Checkable Debates},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {519--529},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_44},
  doi          = {10.1007/978-3-642-22935-0\_44},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/Drucker11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DubeyH11,
  author       = {Chandan K. Dubey and
                  Thomas Holenstein},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Approximating the Closest Vector Problem Using an Approximate Shortest
                  Vector Oracle},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {184--193},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_16},
  doi          = {10.1007/978-3-642-22935-0\_16},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/DubeyH11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DumitrescuJP11,
  author       = {Adrian Dumitrescu and
                  Minghui Jiang and
                  J{\'{a}}nos Pach},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Opaque Sets},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {194--205},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_17},
  doi          = {10.1007/978-3-642-22935-0\_17},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/DumitrescuJP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/EdelmanHNO11,
  author       = {Alan Edelman and
                  Avinatan Hassidim and
                  Huy N. Nguyen and
                  Krzysztof Onak},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {An Efficient Partitioning Oracle for Bounded-Treewidth Graphs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {530--541},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_45},
  doi          = {10.1007/978-3-642-22935-0\_45},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/EdelmanHNO11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeketeKKMS11,
  author       = {S{\'{a}}ndor P. Fekete and
                  Tom Kamphans and
                  Alexander Kr{\"{o}}ller and
                  Joseph S. B. Mitchell and
                  Christiane Schmidt},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Exploring and Triangulating a Region by a Swarm of Robots},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {206--217},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_18},
  doi          = {10.1007/978-3-642-22935-0\_18},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/FeketeKKMS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeldmanNS11,
  author       = {Moran Feldman and
                  Joseph Naor and
                  Roy Schwartz},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Improved Competitive Ratios for Submodular Secretary Problems (Extended
                  Abstract)},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {218--229},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_19},
  doi          = {10.1007/978-3-642-22935-0\_19},
  timestamp    = {Wed, 23 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/FeldmanNS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FischerR11,
  author       = {Eldar Fischer and
                  Eyal Rozenberg},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Inflatable Graph Properties and Natural Property Tests},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {542--554},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_46},
  doi          = {10.1007/978-3-642-22935-0\_46},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/FischerR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FriedrichL11,
  author       = {Tobias Friedrich and
                  Lionel Levine},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Fast Simulation of Large-Scale Growth Models},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {555--566},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_47},
  doi          = {10.1007/978-3-642-22935-0\_47},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/FriedrichL11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GalanisGSVY11,
  author       = {Andreas Galanis and
                  Qi Ge and
                  Daniel Stefankovic and
                  Eric Vigoda and
                  Linji Yang},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Improved Inapproximability Results for Counting Independent Sets in
                  the Hard-Core Model},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {567--578},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_48},
  doi          = {10.1007/978-3-642-22935-0\_48},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/GalanisGSVY11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GoldreichK11,
  author       = {Oded Goldreich and
                  Tali Kaufman},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Proximity Oblivious Testing and the Role of Invariances},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {579--592},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_49},
  doi          = {10.1007/978-3-642-22935-0\_49},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/GoldreichK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GortzN11,
  author       = {Inge Li G{\o}rtz and
                  Viswanath Nagarajan},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Locating Depots for Capacitated Vehicle Routing},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {230--241},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_20},
  doi          = {10.1007/978-3-642-22935-0\_20},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/GortzN11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuruswamiW11,
  author       = {Venkatesan Guruswami and
                  Carol Wang},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Optimal Rate List Decoding via Derivative Codes},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {593--604},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_50},
  doi          = {10.1007/978-3-642-22935-0\_50},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/GuruswamiW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Hastad11,
  author       = {Johan H{\aa}stad},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Satisfying Degree-d Equations over {GF[2]} n},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {242--253},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_21},
  doi          = {10.1007/978-3-642-22935-0\_21},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/Hastad11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HemenwayOSW11,
  author       = {Brett Hemenway and
                  Rafail Ostrovsky and
                  Martin J. Strauss and
                  Mary Wootters},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Public Key Locally Decodable Codes with Short Keys},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {605--615},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_51},
  doi          = {10.1007/978-3-642-22935-0\_51},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/HemenwayOSW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HuangK11,
  author       = {Zhiyi Huang and
                  Sampath Kannan},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {On Sampling from Multivariate Distributions},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {616--627},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_52},
  doi          = {10.1007/978-3-642-22935-0\_52},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/HuangK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HuangWZ11,
  author       = {Zhiyi Huang and
                  Lei Wang and
                  Yuan Zhou},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Black-Box Reductions in Mechanism Design},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {254--265},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_22},
  doi          = {10.1007/978-3-642-22935-0\_22},
  timestamp    = {Wed, 04 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/HuangWZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KaneMN11,
  author       = {Daniel M. Kane and
                  Raghu Meka and
                  Jelani Nelson},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Almost Optimal Explicit Johnson-Lindenstrauss Families},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {628--639},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_53},
  doi          = {10.1007/978-3-642-22935-0\_53},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/KaneMN11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KapralovP11,
  author       = {Michael Kapralov and
                  Rina Panigrahy},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Multiplicative Approximations of Random Walk Transition Probabilities},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {266--276},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_23},
  doi          = {10.1007/978-3-642-22935-0\_23},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/KapralovP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KarpinskiS11,
  author       = {Marek Karpinski and
                  Warren Schudy},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Approximation Schemes for the Betweenness Problem in Tournaments and
                  Related Ranking Problems},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {277--288},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_24},
  doi          = {10.1007/978-3-642-22935-0\_24},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/KarpinskiS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KhandekarKN11,
  author       = {Rohit Khandekar and
                  Guy Kortsarz and
                  Zeev Nutov},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Network-Design with Degree Constraints},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {289--301},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_25},
  doi          = {10.1007/978-3-642-22935-0\_25},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/KhandekarKN11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KhaniS11,
  author       = {M. Reza Khani and
                  Mohammad R. Salavatipour},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded
                  Tree Cover Problems},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {302--314},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_26},
  doi          = {10.1007/978-3-642-22935-0\_26},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/KhaniS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LouisRTV11,
  author       = {Anand Louis and
                  Prasad Raghavendra and
                  Prasad Tetali and
                  Santosh S. Vempala},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues
                  and Partitions},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {315--326},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_27},
  doi          = {10.1007/978-3-642-22935-0\_27},
  timestamp    = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/LouisRTV11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LovettS11,
  author       = {Shachar Lovett and
                  Srikanth Srinivasan},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Correlation Bounds for Poly-size {\textdollar}{\textbackslash}mbox\{{\textbackslash}rm
                  AC\}0{\textdollar} Circuits with n 1 - o(1) Symmetric Gates},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {640--651},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_54},
  doi          = {10.1007/978-3-642-22935-0\_54},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/LovettS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MiracleRS11,
  author       = {Sarah Miracle and
                  Dana Randall and
                  Amanda Pascoe Streib},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Clustering in Interfering Binary Mixtures},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {652--663},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_55},
  doi          = {10.1007/978-3-642-22935-0\_55},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/MiracleRS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/RonRSW11,
  author       = {Dana Ron and
                  Ronitt Rubinfeld and
                  Muli Safra and
                  Omri Weinstein},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Approximating the Influence of Monotone Boolean Functions in {\textdollar}O({\textbackslash}sqrt\{n\}){\textdollar}
                  Query Complexity},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {664--675},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_56},
  doi          = {10.1007/978-3-642-22935-0\_56},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/RonRSW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/RonT11,
  author       = {Dana Ron and
                  Gilad Tsur},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {On Approximating the Number of Relevant Variables in a Function},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {676--687},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_57},
  doi          = {10.1007/978-3-642-22935-0\_57},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/RonT11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/SachdevaS11,
  author       = {Sushant Sachdeva and
                  Rishi Saket},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite
                  Hypergraphs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {327--338},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_28},
  doi          = {10.1007/978-3-642-22935-0\_28},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/SachdevaS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/SnirY11,
  author       = {Sagi Snir and
                  Raphael Yuster},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {A Linear Time Approximation Scheme for Maximum Quartet Consistency
                  on Sparse Sampled Inputs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {339--350},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_29},
  doi          = {10.1007/978-3-642-22935-0\_29},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/SnirY11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Watson11,
  author       = {Thomas Watson},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Query Complexity in Errorless Hardness Amplification},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {688--699},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_58},
  doi          = {10.1007/978-3-642-22935-0\_58},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/Watson11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2011,
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0},
  doi          = {10.1007/978-3-642-22935-0},
  isbn         = {978-3-642-22934-3},
  timestamp    = {Tue, 21 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/2011.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics