Minimal communication cost software construction in the Internet environment

DOI10.1007/S002360050098zbMATH Open0869.68015OpenAlexW1983173569MaRDI QIDQ1920220FDOQ1920220

Authors: Chi-Chung Hui, Samuel T. Chanson 

Publication date: 25 September 1996

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050098

Recommendations

• The Steiner problem in distributed computing systems
• scientific article; zbMATH DE number 2090660
• scientific article; zbMATH DE number 35750
• Placement Des Taches D’Un Programme A Structure Arborescente Sur Un Reseau De Processeurs: Synthese De Resultats Recents
• An LC branch-and-bound algorithm for the module assignment problem

zbMATH Keywords

directed acyclic graphpolynomial algorithmtime complexityInternetlocal area networkcommunication cost

Mathematics Subject Classification ID

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

Cited In (1)

• Costing communication standards in information systems using a minimum cut approach

This page was built for publication: Minimal communication cost software construction in the Internet environment

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