×

Found 135 Documents (Results 1–100)

100
MathJax

Delay-constrained minimum shortest path trees and related problems. (English) Zbl 07550561

Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 676-686 (2021).
MSC:  68T20 90C27
PDF BibTeX XML Cite
Full Text: DOI

From symmetry to asymmetry: generalizing TSP approximations by parametrization. (English) Zbl 07530224

Bampis, Evripidis (ed.) et al., Fundamentals of computation theory. 23rd international symposium, FCT 2021, Athens, Greece, September 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12867, 53-66 (2021).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Approximate minimum directed spanning trees under congestion. (English) Zbl 07495149

Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 352-369 (2021).
MSC:  68Mxx 68Q11 68R10
PDF BibTeX XML Cite
Full Text: DOI

A branch-and-price algorithm for the ring-tree facility location problem. (English) Zbl 07515164

Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 3-14 (2019).
MSC:  05Cxx 90Cxx
PDF BibTeX XML Cite
Full Text: DOI

The \(b\)-branching problem in digraphs. (English) Zbl 07378329

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 12, 15 p. (2018).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

The weighted arborescence constraint. (English) Zbl 06756585

Salvagnin, Domenico (ed.) et al., Integration of AI and OR techniques in constraint programming. 14th international conference, CPAIOR 2017, Padua, Italy, June 5–8, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10335, 185-201 (2017).
MSC:  68R10 68T20
PDF BibTeX XML Cite
Full Text: DOI

How to sort by walking on a tree. (English) Zbl 1369.68175

Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer (ISBN 978-3-662-48349-7/pbk; 978-3-662-48350-3/ebook). Lecture Notes in Computer Science 9294, 643-655 (2015).
PDF BibTeX XML Cite
Full Text: DOI

Multi-classifiers of small treewidth. (English) Zbl 1465.68227

Destercke, Sébastien (ed.) et al., Symbolic and quantitative approaches to reasoning with uncertainty. 13th European conference, ECSQARU 2015, Compiègne, France, July 15–17, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9161, 199-209 (2015).
MSC:  68T05 62H22 62H30
PDF BibTeX XML Cite
Full Text: DOI Link

Hollow heaps. (English) Zbl 1440.68050

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 689-700 (2015).
MSC:  68P05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Optimal matching forests and valuated delta-matroids. (English) Zbl 1341.90119

Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15–17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 404-416 (2011).
PDF BibTeX XML Cite
Full Text: DOI Link

Linear time approximation algorithms for degree constrained subgraph problems. (English) Zbl 1359.90119

Cook, William J. (ed.) et al., Research trends in combinatorial optimization. Papers based on the presentations at the workshop Bonn, Germany, 2008. Dedicated to Bernard Korte on the occasion of the 70th birthday. Berlin: Springer (ISBN 978-3-540-76795-4/hbk). 185-200 (2009).
PDF BibTeX XML Cite
Full Text: DOI Link

Approximating the spanning \(k\)-tree forest problem. (English) Zbl 1248.68562

Deng, Xiaotie (ed.) et al., Frontiers in algorithmics. Third international workshop, FAW 2009, Hefei, China, June 20–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02269-2/pbk). Lecture Notes in Computer Science 5598, 293-301 (2009).
MSC:  68W25 68R10
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Classification

all top 3

Software