×

Found 48 Documents (Results 1–48)

Parameterized approximation algorithms for bidirected Steiner network problems. (English) Zbl 1522.68395

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 20, 16 p. (2018).

Improved approximation algorithm for Steiner \(k\)-Forest with nearly uniform weights. (English) Zbl 1360.68902

Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 17th international workshop on approximation algorithms for combinatorial optimization problems (APPROX 2014) and the 18th international workshop on randomization and computation (RANDOM 2014), Universitat Politècnica de Catalunya, Barcelona, Spain, September 4–6, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-74-3). LIPIcs – Leibniz International Proceedings in Informatics 28, 115-127 (2014).
MSC:  68W25 90C27 90C59
Full Text: DOI

Efficient distributed approximation algorithms via probabilistic tree embeddings. (English) Zbl 1301.68257

Proceedings of the 27th annual ACM symposium on principles of distributed computing, PODC ’08, Toronto, Canada, August 18–21, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-989-0). 263-272 (2008).
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software