×

Found 29 Documents (Results 1–29)

Improved bounds for metric capacitated covering problems. (English) Zbl 07651148

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 9, 17 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Retracting graphs to cycles. (English) Zbl 07561563

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 70, 15 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximation algorithm for vertex cover with multiple covering constraints. (English) Zbl 1518.68266

Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 43, 11 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Capacitated covering problems in geometric spaces. (English) Zbl 1489.68337

Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 7, 15 p. (2018).
MSC:  68U05 68W25
PDFBibTeX XMLCite
Full Text: DOI

Tight approximation for partial vertex cover with hard capacities. (English) Zbl 1457.68312

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 64, 13 p. (2017).
MSC:  68W25 05C65 05C70
PDFBibTeX XMLCite
Full Text: DOI

Primal-dual schema for capacitated covering problems. (English) Zbl 1143.90375

Lodi, Andrea (ed.) et al., Integer programming and combinatorial optimization. 13th international conference, IPCO 2008 Bertinoro, Italy, May 26–28, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-68886-0/pbk). Lecture Notes in Computer Science 5035, 288-302 (2008).
MSC:  90C27 68W25 90C59
PDFBibTeX XMLCite
Full Text: DOI

Capacitated domination and covering: A parameterized perspective. (English) Zbl 1142.68371

Grohe, Martin (ed.) et al., Parameterized and exact computation. Third international workshop, IWPEC 2008, Victoria, Canada, May 14–16, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79722-7/pbk). Lecture Notes in Computer Science 5018, 78-90 (2008).
MSC:  68Q25 68Q17 68R10
PDFBibTeX XMLCite
Full Text: DOI

Capacitated domination problem. (English) Zbl 1193.05127

Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 256-267 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field