Min-Sum 2-Paths Problems

DOI10.1007/978-3-319-08001-7_1zbMath1416.68133OpenAlexW4206682992MaRDI QIDQ3188861

Oded Lachish, Alexandru Popa, Trevor I. Fenner

Publication date: 2 September 2014

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08001-7_1

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

On the edge capacitated Steiner tree problem

This page was built for publication: Min-Sum 2-Paths Problems