The Complexity of an Optimal File Transfer Problem
スポンサーリンク
概要
- 論文の詳細を見る
A problem of obtaining an optimal file transfer on a file transmission net N is to consider how to distribute, with a minimum total cost, copies of a certain file of information from some vertices to others on N by the respective vertices' copy demand numbers. This paper proves such a problem to be NP-hard in general.
- 社団法人電子情報通信学会の論文
- 1999-02-25
著者
-
Shinoda Shoji
Faculty Of Engineering Chuo University
-
Kaneko Yoshihiro
Faculty Of Engineering Gifu University
関連論文
- SB-10-2 Effects of Mobility and Capacity on Cell Extension by Wireless Multi-hop Networking
- Analysis of Connection Delay in Cellular Mobile Communication Systems Using Dynamic Channel Assignment (Special Section on Mutli-dimensional Mobile Information Network)
- Effect of a New Channel Assignment Strategy on Multihop Wireless Networks(Ad-hoc Network)(Mobile Multimedia Communications)
- On a Generalization of a Covering Problem Called Single Cover on Undirected Flow Networks (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems)
- Development in Graph- and/or Network-Theoretic Research of Cellular Mobile Communication Channel Assignment Problems (Special Section on Surveys of Researches in CAS Fields in the Last Two Decadeses, II(
- An Optimal File Transfer on a Path Network with 2-level Arc Cost and Positive Demands
- A Synthesis of a Forest-Type Optimal File Transfer on a File Transmission Net with Source Vertices
- On an Optimal File Transfer on an Arborescence-Net with Constraints on Copying Numbers
- On an Optimum File Transfer on a File Transmission Net (Special Section of Letters Selected from the 1993 IEICE Spring Conference)
- An Optimal File Transfer on Networks with Plural Original Files(Regular Sction)
- Characteristics of Dynamic Channel Assignment in Cellular Systems with Reuse Partitioning (Special Section on Multi-dimensional Mobile Information Network)
- On Canonical Partition of Edge Set (Applied Combinatorial Theory and Algorithms)
- The Complexity of an Optimal File Transfer Problem
- On Solutions of the Element-Value Determinability Problem of Linear Analog Circuits (Special Section on Surveys of Researches in CAS Fields in the Last Two Decadeses, II(
- On a Problem of Designing a 2-Switch Node Network
- Functions Measuring the Centrality (or Mediality) of a point in a Network(GRAPH THEORY AND APPLICATIONS)
- B-20-9 The utilization of betwenness for DSDV
- The rank difference of node centrality between global and local graphs
- The rank difference of node centrality between global and local graphs
- The rank difference of node centrality between global and local graphs
- The rank difference of node centrality between global and local graphs