scientific article; zbMATH DE number 1163718

zbMATH Open0901.05085MaRDI QIDQ4395331FDOQ4395331

R. Ravi, Sven O. Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe

Publication date: 4 August 1998

Title of this publication is not available (Why is that?)

zbMATH Keywords

delaycomplexityspanning treeVLSI designupgradingoptimal network

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Cited In (8)

• To improve the communication delay by upgrading nodes in a continuous version
• Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies
• Title not available (Why is that?)
• Improving spanning trees by upgrading nodes
• A GRASP metaheuristic to improve accessibility after a disaster
• Robust flows with losses and improvability in evacuation planning
• Improving Minimum Cost Spanning Trees by Upgrading Nodes
• Network upgrading problems

   Recommendations

• Approximation algorithms for certain network improvement problems 👍 👎
• Improving spanning trees by upgrading nodes 👍 👎
• Improving spanning trees by upgrading nodes 👍 👎
• Improving Minimum Cost Spanning Trees by Upgrading Nodes 👍 👎

This page was built for publication:

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