File transfer tree problems

DOI10.1007/3-540-36136-7_39MaRDI QIDQ4427866zbMATH OpenFDO

Authors Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, M. Fujita

Publication date 14 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2518/25180441.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2170332
• An optimal file transfer on a directed path network with step arc costs
• Scheduling File Transfers for Trees and Odd Cycles
• Approximating capacitated tree-routings in networks
• Approximating Capacitated Tree-Routings in Networks

Cited in

(2)

• An optimal file transfer on a directed path network with step arc costs
• scientific article; zbMATH DE number 2170332 (Why is no real title available?)

This page was built for publication: File transfer tree problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427866)