BibTeX records: Lars Engebretsen

download as .bib file

@article{DBLP:journals/rsa/EngebretsenH08,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  title        = {More efficient queries in PCPs for {NP} and improved approximation
                  hardness of maximum {CSP}},
  journal      = {Random Struct. Algorithms},
  volume       = {33},
  number       = {4},
  pages        = {497--514},
  year         = {2008},
  url          = {https://doi.org/10.1002/rsa.20226},
  doi          = {10.1002/RSA.20226},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/EngebretsenH08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Engebretsen07,
  author       = {Lars Engebretsen},
  title        = {Bipartite multigraphs with expander-like properties},
  journal      = {Discret. Appl. Math.},
  volume       = {155},
  number       = {13},
  pages        = {1667--1677},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.dam.2007.03.001},
  doi          = {10.1016/J.DAM.2007.03.001},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Engebretsen07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/EngebretsenK06,
  author       = {Lars Engebretsen and
                  Marek Karpinski},
  title        = {{TSP} with bounded metrics},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {72},
  number       = {4},
  pages        = {509--546},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.jcss.2005.12.001},
  doi          = {10.1016/J.JCSS.2005.12.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/EngebretsenK06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/EngebretsenS06,
  author       = {Lars Engebretsen and
                  Madhu Sudan},
  title        = {Harmonic broadcasting is bandwidth-optimal assuming constant bit rate},
  journal      = {Networks},
  volume       = {47},
  number       = {3},
  pages        = {172--177},
  year         = {2006},
  url          = {https://doi.org/10.1002/net.20105},
  doi          = {10.1002/NET.20105},
  timestamp    = {Tue, 14 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/EngebretsenS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/spe/Engebretsen06,
  author       = {Lars Engebretsen},
  title        = {Platform-independent code conversion within the {C++} locale framework},
  journal      = {Softw. Pract. Exp.},
  volume       = {36},
  number       = {15},
  pages        = {1643--1654},
  year         = {2006},
  url          = {https://doi.org/10.1002/spe.734},
  doi          = {10.1002/SPE.734},
  timestamp    = {Thu, 09 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/spe/Engebretsen06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/EngebretsenH05,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  title        = {Three-query PCPs with perfect completeness over non-Boolean domains},
  journal      = {Random Struct. Algorithms},
  volume       = {27},
  number       = {1},
  pages        = {46--75},
  year         = {2005},
  url          = {https://doi.org/10.1002/rsa.20050},
  doi          = {10.1002/RSA.20050},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/EngebretsenH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/EngebretsenH05,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {More Efficient Queries in PCPs for {NP} and Improved Approximation
                  Hardness of Maximum {CSP}},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {194--205},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_16},
  doi          = {10.1007/978-3-540-31856-9\_16},
  timestamp    = {Wed, 19 May 2021 12:05:43 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/EngebretsenH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Engebretsen04,
  author       = {Lars Engebretsen},
  title        = {Simplified tight analysis of Johnson's algorithm},
  journal      = {Inf. Process. Lett.},
  volume       = {92},
  number       = {4},
  pages        = {207--210},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.ipl.2004.08.001},
  doi          = {10.1016/J.IPL.2004.08.001},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Engebretsen04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/EngebretsenG04,
  author       = {Lars Engebretsen and
                  Venkatesan Guruswami},
  title        = {Is constraint satisfaction over two variables always easy?},
  journal      = {Random Struct. Algorithms},
  volume       = {25},
  number       = {2},
  pages        = {150--178},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20026},
  doi          = {10.1002/RSA.20026},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/EngebretsenG04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/Engebretsen04,
  author       = {Lars Engebretsen},
  title        = {The Nonapproximability of Non-Boolean Predicates},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {18},
  number       = {1},
  pages        = {114--129},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0895480100380458},
  doi          = {10.1137/S0895480100380458},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Engebretsen04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EngebretsenHR04,
  author       = {Lars Engebretsen and
                  Jonas Holmerin and
                  Alexander Russell},
  title        = {Inapproximability results for equations over finite groups},
  journal      = {Theor. Comput. Sci.},
  volume       = {312},
  number       = {1},
  pages        = {17--45},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0304-3975(03)00401-8},
  doi          = {10.1016/S0304-3975(03)00401-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EngebretsenHR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Engebretsen03,
  author       = {Lars Engebretsen},
  title        = {An Explicit Lower Bound for {TSP} with Distances One and Two},
  journal      = {Algorithmica},
  volume       = {35},
  number       = {4},
  pages        = {301--318},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-002-1001-6},
  doi          = {10.1007/S00453-002-1001-6},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Engebretsen03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EngebretsenH03,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  title        = {Towards optimal lower bounds for clique and chromatic number},
  journal      = {Theor. Comput. Sci.},
  volume       = {299},
  number       = {1-3},
  pages        = {537--584},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00535-2},
  doi          = {10.1016/S0304-3975(02)00535-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EngebretsenH03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/EngebretsenH03,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  title        = {Three-Query PCPs with Perfect Completeness over non-Boolean Domains},
  booktitle    = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
                  2003), 7-10 July 2003, Aarhus, Denmark},
  pages        = {284--299},
  publisher    = {{IEEE} Computer Society},
  year         = {2003},
  url          = {https://doi.org/10.1109/CCC.2003.1214428},
  doi          = {10.1109/CCC.2003.1214428},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/EngebretsenH03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/AnderssonE02,
  author       = {Gunnar Andersson and
                  Lars Engebretsen},
  title        = {Property testers for dense constraint satisfaction programs on finite
                  domains},
  journal      = {Random Struct. Algorithms},
  volume       = {21},
  number       = {1},
  pages        = {14--32},
  year         = {2002},
  url          = {https://doi.org/10.1002/rsa.10041},
  doi          = {10.1002/RSA.10041},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/AnderssonE02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/EngebretsenHR02,
  author       = {Lars Engebretsen and
                  Jonas Holmerin and
                  Alexander Russell},
  editor       = {Peter Widmayer and
                  Francisco Triguero Ruiz and
                  Rafael Morales Bueno and
                  Matthew Hennessy and
                  Stephan J. Eidenbenz and
                  Ricardo Conejo},
  title        = {Inapproximability Results for Equations over Finite Groups},
  booktitle    = {Automata, Languages and Programming, 29th International Colloquium,
                  {ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2380},
  pages        = {73--84},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45465-9\_8},
  doi          = {10.1007/3-540-45465-9\_8},
  timestamp    = {Wed, 11 Sep 2019 13:15:53 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/EngebretsenHR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/random/EngebretsenG02,
  author       = {Lars Engebretsen and
                  Venkatesan Guruswami},
  editor       = {Jos{\'{e}} D. P. Rolim and
                  Salil P. Vadhan},
  title        = {Is Constraint Satisfaction Over Two Variables Always Easy?},
  booktitle    = {Randomization and Approximation Techniques, 6th International Workshop,
                  {RANDOM} 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2483},
  pages        = {224--238},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45726-7\_18},
  doi          = {10.1007/3-540-45726-7\_18},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/random/EngebretsenG02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/EngebretsenS02,
  author       = {Lars Engebretsen and
                  Madhu Sudan},
  editor       = {David Eppstein},
  title        = {Harmonic broadcasting is optimal},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {431--432},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545438},
  timestamp    = {Tue, 14 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/EngebretsenS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/EngebretsenIO02,
  author       = {Lars Engebretsen and
                  Piotr Indyk and
                  Ryan O'Donnell},
  editor       = {David Eppstein},
  title        = {Derandomized dimensionality reduction with applications},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages        = {705--712},
  publisher    = {{ACM/SIAM}},
  year         = {2002},
  url          = {http://dl.acm.org/citation.cfm?id=545381.545476},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/EngebretsenIO02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR02-030,
  author       = {Lars Engebretsen and
                  Jonas Holmerin and
                  Alexander Russell},
  title        = {Inapproximability Results for Equations over Finite Groups},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR02-030}},
  year         = {2002},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-030/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR02-030},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR02-030.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR02-040,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  title        = {Three-Query PCPs with Perfect Completeness over non-Boolean Domains},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR02-040}},
  year         = {2002},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-040/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR02-040},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR02-040.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR02-053,
  author       = {Lars Engebretsen and
                  Venkatesan Guruswami},
  title        = {Is Constraint Satisfaction Over Two Variables Always Easy?},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR02-053}},
  year         = {2002},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-053/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR02-053},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR02-053.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/AnderssonEH01,
  author       = {Gunnar Andersson and
                  Lars Engebretsen and
                  Johan H{\aa}stad},
  title        = {A New Way of Using Semidefinite Programming with Applications to Linear
                  Equations mod p},
  journal      = {J. Algorithms},
  volume       = {39},
  number       = {2},
  pages        = {162--204},
  year         = {2001},
  url          = {https://doi.org/10.1006/jagm.2000.1154},
  doi          = {10.1006/JAGM.2000.1154},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/AnderssonEH01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fotfs/Engebretsen01,
  author       = {Lars Engebretsen},
  editor       = {Benedikt L{\"{o}}we and
                  Boris Piwinger and
                  Thoralf R{\"{a}}sch},
  title        = {Using easy optimization problems to solve hard ones},
  booktitle    = {Classical and New Paradigms of Computation and their Complexity Hierarchies,
                  Papers of the conference "Foundations of the Formal Sciences III",
                  Wien, Asutria, September 21-24, 2001},
  series       = {Trends in Logic},
  volume       = {23},
  pages        = {77--93},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/978-1-4020-2776-5\_6},
  doi          = {10.1007/978-1-4020-2776-5\_6},
  timestamp    = {Fri, 29 May 2020 16:39:30 +0200},
  biburl       = {https://dblp.org/rec/conf/fotfs/Engebretsen01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/EngebretsenK01,
  author       = {Lars Engebretsen and
                  Marek Karpinski},
  editor       = {Fernando Orejas and
                  Paul G. Spirakis and
                  Jan van Leeuwen},
  title        = {Approximation Hardness of {TSP} with Bounded Metrics},
  booktitle    = {Automata, Languages and Programming, 28th International Colloquium,
                  {ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2076},
  pages        = {201--212},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-48224-5\_17},
  doi          = {10.1007/3-540-48224-5\_17},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/EngebretsenK01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/random/Engebretsen01,
  author       = {Lars Engebretsen},
  editor       = {Michel X. Goemans and
                  Klaus Jansen and
                  Jos{\'{e}} D. P. Rolim and
                  Luca Trevisan},
  title        = {The Non-approximability of Non-Boolean Predicates},
  booktitle    = {Approximation, Randomization and Combinatorial Optimization: Algorithms
                  and Techniques, 4th International Workshop on Approximation Algorithms
                  for Combinatorial Optimization Problems, {APPROX} 2001 and 5th International
                  Workshop on Randomization and Approximation Techniques in Computer
                  Science, {RANDOM} 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2129},
  pages        = {241--248},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-44666-4\_27},
  doi          = {10.1007/3-540-44666-4\_27},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/random/Engebretsen01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR01-003,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  title        = {Towards Optimal Lower Bounds For Clique and Chromatic Number},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR01-003}},
  year         = {2001},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-003/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR01-003},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR01-003.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/EngebretsenH00,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  editor       = {Ugo Montanari and
                  Jos{\'{e}} D. P. Rolim and
                  Emo Welzl},
  title        = {Clique Is Hard to Approximate within \emph{n}\({}^{\mbox{1-\emph{o}(1)}}\)},
  booktitle    = {Automata, Languages and Programming, 27th International Colloquium,
                  {ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1853},
  pages        = {2--12},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-45022-X\_2},
  doi          = {10.1007/3-540-45022-X\_2},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/EngebretsenH00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR00-042,
  author       = {Lars Engebretsen},
  title        = {Lower Bounds for non-Boolean Constraint Satisfaction},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR00-042}},
  year         = {2000},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-042/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR00-042},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR00-042.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR00-089,
  author       = {Lars Engebretsen and
                  Marek Karpinski},
  title        = {Approximation Hardness of {TSP} with Bounded Metrics},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR00-089}},
  year         = {2000},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-089/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR00-089},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR00-089.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/AnderssonEH99,
  author       = {Gunnar Andersson and
                  Lars Engebretsen and
                  Johan H{\aa}stad},
  editor       = {Robert Endre Tarjan and
                  Tandy J. Warnow},
  title        = {A New Way to Use Semidefinite Programming with Applications to Linear
                  Equations mod \emph{p}},
  booktitle    = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
                  17-19 January 1999, Baltimore, Maryland, {USA}},
  pages        = {41--50},
  publisher    = {{ACM/SIAM}},
  year         = {1999},
  url          = {http://dl.acm.org/citation.cfm?id=314500.314529},
  timestamp    = {Thu, 05 Jul 2018 07:29:57 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/AnderssonEH99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Engebretsen99,
  author       = {Lars Engebretsen},
  editor       = {Christoph Meinel and
                  Sophie Tison},
  title        = {An Explicit Lower Bound for {TSP} with Distances One and Two},
  booktitle    = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
                  Science, Trier, Germany, March 4-6, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1563},
  pages        = {373--382},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-49116-3\_35},
  doi          = {10.1007/3-540-49116-3\_35},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Engebretsen99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/AnderssonE98,
  author       = {Gunnar Andersson and
                  Lars Engebretsen},
  title        = {Better Approximation Algorithms for {SET} {SPLITTING} and {NOT-ALL-EQUAL}
                  {SAT}},
  journal      = {Inf. Process. Lett.},
  volume       = {65},
  number       = {6},
  pages        = {305--311},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0020-0190(98)00021-0},
  doi          = {10.1016/S0020-0190(98)00021-0},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/AnderssonE98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/random/AnderssonE98,
  author       = {Gunnar Andersson and
                  Lars Engebretsen},
  editor       = {Michael Luby and
                  Jos{\'{e}} D. P. Rolim and
                  Maria J. Serna},
  title        = {Sampling Methods Applied to Dense Instances of Non-Boolean Optimization
                  Problems},
  booktitle    = {Randomization and Approximation Techniques in Computer Science, Second
                  International Workshop, RANDOM'98, Barcelona, Spain, October 8-10,
                  1998, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1518},
  pages        = {357--368},
  publisher    = {Springer},
  year         = {1998},
  url          = {https://doi.org/10.1007/3-540-49543-6\_28},
  doi          = {10.1007/3-540-49543-6\_28},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/random/AnderssonE98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR98-046,
  author       = {Lars Engebretsen},
  title        = {An Explicit Lower Bound for {TSP} with Distances One and Two},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR98-046}},
  year         = {1998},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-046/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR98-046},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR98-046.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR97-022,
  author       = {Gunnar Andersson and
                  Lars Engebretsen},
  title        = {Better Approximation Algorithms and Tighter Analysis for Set Splitting
                  and Not-All-Equal Sat},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR97-022}},
  year         = {1997},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-022/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR97-022},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR97-022.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.