Published in: LIPIcs, Volume 214, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021)
Andreas Emil Feldmann and Ashutosh Rai. On Extended Formulations For Parameterized Steiner Trees. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 18:1-18:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{feldmann_et_al:LIPIcs.IPEC.2021.18, author = {Feldmann, Andreas Emil and Rai, Ashutosh}, title = {{On Extended Formulations For Parameterized Steiner Trees}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {18:1--18:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.18}, URN = {urn:nbn:de:0030-drops-154010}, doi = {10.4230/LIPIcs.IPEC.2021.18}, annote = {Keywords: Steiner trees, integral linear program, extension complexity, fixed-parameter tractability} }
Published in: LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)
Eden Chlamtáč and Petr Kolman. How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 41:1-41:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chlamtac_et_al:LIPIcs.APPROX/RANDOM.2020.41, author = {Chlamt\'{a}\v{c}, Eden and Kolman, Petr}, title = {{How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {41:1--41:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-164-1}, ISSN = {1868-8969}, year = {2020}, volume = {176}, editor = {Byrka, Jaros{\l}aw and Meka, Raghu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.41}, URN = {urn:nbn:de:0030-drops-126446}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.41}, annote = {Keywords: Approximation Algorithms, Length Bounded Cuts, Cut-Flow Duality, Rounding of Linear Programms} }
Published in: LIPIcs, Volume 53, 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)
Petr Kolman, Martin Koutecký, and Hans Raj Tiwary. Extension Complexity, MSO Logic, and Treewidth. In 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 53, pp. 18:1-18:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kolman_et_al:LIPIcs.SWAT.2016.18, author = {Kolman, Petr and Kouteck\'{y}, Martin and Tiwary, Hans Raj}, title = {{Extension Complexity, MSO Logic, and Treewidth}}, booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-011-8}, ISSN = {1868-8969}, year = {2016}, volume = {53}, editor = {Pagh, Rasmus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.18}, URN = {urn:nbn:de:0030-drops-60405}, doi = {10.4230/LIPIcs.SWAT.2016.18}, annote = {Keywords: Extension Complexity, FPT, Courcelle's Theorem, MSO Logic} }
Published in: LIPIcs, Volume 9, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Petr Kolman and Christian Scheideler. Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 129-140, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{kolman_et_al:LIPIcs.STACS.2011.129, author = {Kolman, Petr and Scheideler, Christian}, title = {{Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {129--140}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.129}, URN = {urn:nbn:de:0030-drops-30051}, doi = {10.4230/LIPIcs.STACS.2011.129}, annote = {Keywords: Multicommodity flow, Multiroute flow, Cuts, Duality} }
Feedback for Dagstuhl Publishing