Minimum back-walk-free latency problem

DOI10.1007/3-540-45655-4_56MaRDI QIDQ4808675zbMATH OpenFDO

Authors Yaw-Ling Lin

Publication date 12 August 2004

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/2387/23870525.htm

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Polynomial time algorithms for some minimum latency problems
• The minimum latency problem is NP-hard for weighted trees
• The minimum latency problem
• The Directed Minimum Latency Problem
• scientific article; zbMATH DE number 871910

Cited in

(4)

• Weighted online minimum latency problem with edge uncertainty
• The minimum latency problem is NP-hard for weighted trees
• On the minimum delay problem
• The minimum backlog problem

This page was built for publication: Minimum back-walk-free latency problem

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