To improve the communication delay by upgrading nodes in a continuous version

MaRDI QIDQ2583103zbMATH OpenFDO

Authors Xiaoguang Yang

Publication date 13 January 2006

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

zbMATH Keywords

inapproximabilitysolvability

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 1163718
• Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies
• Network upgrading problems
• Approximation algorithms for certain network improvement problems
• Upgrading bottleneck constrained forests

Cited in

(2)

• Network upgrading problems
• Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies

This page was built for publication: To improve the communication delay by upgrading nodes in a continuous version

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