×

Found 14 Documents (Results 1–14)

Tight approximation algorithms for bichromatic graph diameter and related problems. (English) Zbl 07561540

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 47, 15 p. (2019).
MSC:  68Nxx 68Qxx

A PTAS for three-edge-connected survivable network design in planar graphs. (English) Zbl 1467.68137

Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 20th international workshop, APPROX 2017 and 21st international workshop, RANDOM 2017, Berkeley, CA, USA, August 16–18, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 81, Article 3, 13 p. (2017).

A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting. (English) Zbl 1376.68168

Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 570-583 (2016).
Full Text: DOI

A polynomial-time approximation scheme for planar multiway cut. (English) Zbl 1422.68294

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 639-655 (2012).

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software