Search dblp for Publications

export results for "toc:db/journals/algorithmica/algorithmica59.bht:"

 download as .bib file

@article{DBLP:journals/algorithmica/BansalCP11,
  author       = {Nikhil Bansal and
                  Ho{-}Leung Chan and
                  Kirk Pruhs},
  title        = {Competitive Algorithms for Due Date Scheduling},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {4},
  pages        = {569--582},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9321-4},
  doi          = {10.1007/S00453-009-9321-4},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BansalCP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BernH11,
  author       = {Marshall W. Bern and
                  Barry Hayes},
  title        = {Origami Embedding of Piecewise-Linear Two-Manifolds},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {1},
  pages        = {3--15},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9399-8},
  doi          = {10.1007/S00453-010-9399-8},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BernH11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/CardinalDFJLNW11,
  author       = {Jean Cardinal and
                  Erik D. Demaine and
                  Samuel Fiorini and
                  Gwena{\"{e}}l Joret and
                  Stefan Langerman and
                  Ilan Newman and
                  Oren Weimann},
  title        = {The Stackelberg Minimum Spanning Tree Game},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {2},
  pages        = {129--144},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9299-y},
  doi          = {10.1007/S00453-009-9299-Y},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/CardinalDFJLNW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ChepoiS11,
  author       = {Victor Chepoi and
                  Morgan Seston},
  title        = {Seriation in the Presence of Errors: {A} Factor 16 Approximation Algorithm
                  for \emph{l}\({}_{\mbox{{\(\infty\)}}}\)-Fitting Robinson Structures
                  to Distances},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {4},
  pages        = {521--568},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9319-y},
  doi          = {10.1007/S00453-009-9319-Y},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChepoiS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DaudeR11,
  author       = {Herv{\'{e}} Daud{\'{e}} and
                  Vlady Ravelomanana},
  title        = {Random 2 {XORSAT} Phase Transition},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {1},
  pages        = {48--65},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9308-1},
  doi          = {10.1007/S00453-009-9308-1},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DaudeR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DeanGPW11,
  author       = {Brian C. Dean and
                  Adam Griffis and
                  Ojas Parekh and
                  Adam A. Whitley},
  title        = {Approximation Algorithms for \emph{k}-hurdle Problems},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {1},
  pages        = {81--93},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9408-y},
  doi          = {10.1007/S00453-010-9408-Y},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DeanGPW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DeshpandeKMT11,
  author       = {Amol Deshpande and
                  Samir Khuller and
                  Azarakhsh Malekian and
                  Mohammed Toossi},
  title        = {Energy Efficient Monitoring in Sensor Networks},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {1},
  pages        = {94--114},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9407-z},
  doi          = {10.1007/S00453-010-9407-Z},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DeshpandeKMT11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DietzfelbingerRWW11,
  author       = {Martin Dietzfelbinger and
                  Jonathan E. Rowe and
                  Ingo Wegener and
                  Philipp Woelfel},
  title        = {Precision, Local Search and Unimodal Functions},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {3},
  pages        = {301--322},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9352-x},
  doi          = {10.1007/S00453-009-9352-X},
  timestamp    = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DietzfelbingerRWW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DoerrJ11,
  author       = {Benjamin Doerr and
                  Thomas Jansen},
  title        = {Theory of Evolutionary Computation},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {3},
  pages        = {299--300},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9472-3},
  doi          = {10.1007/S00453-010-9472-3},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DoerrJ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DurrH11,
  author       = {Christoph D{\"{u}}rr and
                  Mathilde Hurand},
  title        = {Finding Total Unimodularity in Optimization Problems Solved by Linear
                  Programs},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {2},
  pages        = {256--268},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9310-7},
  doi          = {10.1007/S00453-009-9310-7},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DurrH11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/FournierT11,
  author       = {Herv{\'{e}} Fournier and
                  Olivier Teytaud},
  title        = {Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension
                  and Sign Patterns},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {3},
  pages        = {387--408},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9391-3},
  doi          = {10.1007/S00453-010-9391-3},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FournierT11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/GuptaT11,
  author       = {Anupam Gupta and
                  Kunal Talwar},
  title        = {Making Doubling Metrics Geodesic},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {1},
  pages        = {66--80},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9397-x},
  doi          = {10.1007/S00453-010-9397-X},
  timestamp    = {Wed, 18 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GuptaT11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/HavetKKKL11,
  author       = {Fr{\'{e}}d{\'{e}}ric Havet and
                  Martin Klazar and
                  Jan Kratochv{\'{\i}}l and
                  Dieter Kratsch and
                  Mathieu Liedloff},
  title        = {Exact Algorithms for \emph{L}(2, 1)-Labeling of Graphs},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {2},
  pages        = {169--194},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9302-7},
  doi          = {10.1007/S00453-009-9302-7},
  timestamp    = {Mon, 06 Nov 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/HavetKKKL11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/HoangS11,
  author       = {Viet Tung Hoang and
                  Wing{-}Kin Sung},
  title        = {Improved Algorithms for Maximum Agreement and~Compatible Supertrees},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {2},
  pages        = {195--214},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9303-6},
  doi          = {10.1007/S00453-009-9303-6},
  timestamp    = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/HoangS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/InuiG11,
  author       = {Yoshifumi Inui and
                  Fran{\c{c}}ois Le Gall},
  title        = {Quantum Property Testing of Group Solvability},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {1},
  pages        = {35--47},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9338-8},
  doi          = {10.1007/S00453-009-9338-8},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/InuiG11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Jagerskupper11,
  author       = {Jens J{\"{a}}gersk{\"{u}}pper},
  title        = {Combining Markov-Chain Analysis and Drift Analysis - The (1+1)~Evolutionary
                  Algorithm on Linear Functions Reloaded},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {3},
  pages        = {409--424},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9396-y},
  doi          = {10.1007/S00453-010-9396-Y},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Jagerskupper11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/JebaliaAH11,
  author       = {Mohamed Jebalia and
                  Anne Auger and
                  Nikolaus Hansen},
  title        = {Log-Linear Convergence and Divergence of~the~Scale-Invariant {(1+1)-ES}
                  in Noisy Environments},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {3},
  pages        = {425--460},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9403-3},
  doi          = {10.1007/S00453-010-9403-3},
  timestamp    = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/JebaliaAH11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/JoerisLMSS11,
  author       = {Benson L. Joeris and
                  Min Chih Lin and
                  Ross M. McConnell and
                  Jeremy P. Spinrad and
                  Jayme Luiz Szwarcfiter},
  title        = {Linear-Time Recognition of Helly Circular-Arc Models and Graphs},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {2},
  pages        = {215--239},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9304-5},
  doi          = {10.1007/S00453-009-9304-5},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/JoerisLMSS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KavithaMM11,
  author       = {Telikepalli Kavitha and
                  Kurt Mehlhorn and
                  Dimitrios Michail},
  title        = {New Approximation Algorithms for Minimum Cycle Bases of Graphs},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {4},
  pages        = {471--488},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9313-4},
  doi          = {10.1007/S00453-009-9313-4},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KavithaMM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KimNSP11,
  author       = {Dong Kyue Kim and
                  Joong Chae Na and
                  Jeong Seop Sim and
                  Kunsoo Park},
  title        = {Linear-Time Construction of Two-Dimensional Suffix~Trees},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {2},
  pages        = {269--297},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9350-z},
  doi          = {10.1007/S00453-009-9350-Z},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KimNSP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KonemannPS11,
  author       = {Jochen K{\"{o}}nemann and
                  Ojas Parekh and
                  Danny Segev},
  title        = {A Unified Approach to Approximating Partial Covering Problems},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {4},
  pages        = {489--509},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9317-0},
  doi          = {10.1007/S00453-009-9317-0},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KonemannPS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KowalikM11,
  author       = {Lukasz Kowalik and
                  Marcin Mucha},
  title        = {35/44-approximation for Asymmetric Maximum {TSP} with Triangle Inequality},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {2},
  pages        = {240--255},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9306-3},
  doi          = {10.1007/S00453-009-9306-3},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KowalikM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/LaberBF11,
  author       = {Eduardo Sany Laber and
                  Claudson F. Bornstein and
                  Cristina G. Fernandes},
  title        = {Guest Editorial: Special Issue on Latin American Theoretical Informatics
                  Symposium {(LATIN)}},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {1},
  pages        = {1--2},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9473-2},
  doi          = {10.1007/S00453-010-9473-2},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LaberBF11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/LaberM11,
  author       = {Eduardo Sany Laber and
                  Marco Molinaro},
  title        = {An Approximation Algorithm for Binary Searching in Trees},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {4},
  pages        = {601--620},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9325-0},
  doi          = {10.1007/S00453-009-9325-0},
  timestamp    = {Sat, 05 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LaberM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/MarkovS11,
  author       = {Igor L. Markov and
                  Yaoyun Shi},
  title        = {Constant-Degree Graph Expansions that Preserve Treewidth},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {4},
  pages        = {461--470},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9312-5},
  doi          = {10.1007/S00453-009-9312-5},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MarkovS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/NeumannRS11,
  author       = {Frank Neumann and
                  Joachim Reichel and
                  Martin Skutella},
  title        = {Computing Minimum Cuts by Randomized Search Heuristics},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {3},
  pages        = {323--342},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9370-8},
  doi          = {10.1007/S00453-009-9370-8},
  timestamp    = {Mon, 30 Jul 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/NeumannRS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/OlaverriT11,
  author       = {Alfredo Garc{\'{\i}}a Olaverri and
                  Javier Tejel},
  title        = {Augmenting the Rigidity of a Graph in \emph{R}\({}^{\mbox{2}}\)},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {2},
  pages        = {145--168},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9300-9},
  doi          = {10.1007/S00453-009-9300-9},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/OlaverriT11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/OlivetoW11,
  author       = {Pietro S. Oliveto and
                  Carsten Witt},
  title        = {Simplified Drift Analysis for Proving Lower Bounds in~Evolutionary
                  Computation},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {3},
  pages        = {369--386},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9387-z},
  doi          = {10.1007/S00453-010-9387-Z},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/OlivetoW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/RapaportSTV11,
  author       = {Ivan Rapaport and
                  Karol Suchan and
                  Ioan Todinca and
                  Jacques Verstra{\"{e}}te},
  title        = {On Dissemination Thresholds in Regular and Irregular Graph Classes},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {1},
  pages        = {16--34},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9309-0},
  doi          = {10.1007/S00453-009-9309-0},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/RapaportSTV11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/RodittyS11,
  author       = {Liam Roditty and
                  Michael Segal},
  title        = {On Bounded Leg Shortest Paths Problems},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {4},
  pages        = {583--600},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9322-3},
  doi          = {10.1007/S00453-009-9322-3},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/RodittyS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ShapiraYZ11,
  author       = {Asaf Shapira and
                  Raphael Yuster and
                  Uri Zwick},
  title        = {All-Pairs Bottleneck Paths in Vertex Weighted Graphs},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {4},
  pages        = {621--633},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9328-x},
  doi          = {10.1007/S00453-009-9328-X},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ShapiraYZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/StreppelY11,
  author       = {Micha Streppel and
                  Ke Yi},
  title        = {Approximate Range Searching in External Memory},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {2},
  pages        = {115--128},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9297-0},
  doi          = {10.1007/S00453-009-9297-0},
  timestamp    = {Tue, 21 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/StreppelY11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Sudholt11,
  author       = {Dirk Sudholt},
  title        = {Hybridizing Evolutionary Algorithms with~Variable-Depth Search to
                  Overcome Local Optima},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {3},
  pages        = {343--368},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9384-2},
  doi          = {10.1007/S00453-009-9384-2},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Sudholt11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/XiaoCY11,
  author       = {Mingyu Xiao and
                  Leizhen Cai and
                  Andrew Chi{-}Chih Yao},
  title        = {Tight Approximation Ratio of a General Greedy Splitting Algorithm
                  for the Minimum \emph{k}-Way Cut Problem},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {4},
  pages        = {510--520},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9316-1},
  doi          = {10.1007/S00453-009-9316-1},
  timestamp    = {Mon, 08 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/XiaoCY11.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.