scientific article; zbMATH DE number 2161745

MaRDI QIDQ4671669zbMATH OpenFDO

Authors Hiroaki Mohri

Publication date 26 April 2005

zbMATH Keywords

computational complexity theory

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Network design with a discrete set of traffic matrices
• scientific article; zbMATH DE number 3848612
• Hardness of robust network design
• A characterization of the uncapacitated network design polytope
• On a Network Design Problem That Is Intractable on Trees

Cited in

(8)

• Network design with a discrete set of traffic matrices
• Design networks with bounded pairwise distance
• scientific article; zbMATH DE number 3848612 (Why is no real title available?)
• scientific article; zbMATH DE number 409471 (Why is no real title available?)
• scientific article; zbMATH DE number 1509501 (Why is no real title available?)
• scientific article; zbMATH DE number 906533 (Why is no real title available?)
• scientific article; zbMATH DE number 6423757 (Why is no real title available?)
• Node-weighted Network Design in Planar and Minor-closed Families of Graphs

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 Q4671669)