Envy-Free Resource Sharing on a Temporal Network Using a Minimum Cost Circulation Problem.
Ryo HaseMitsue ImahoriNorihiko ShinomiyaPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2021)
Keyphrases
- minimum cost
- resource sharing
- network flow problem
- network flow
- peer to peer
- network resources
- spanning tree
- np hard
- approximation algorithms
- resource allocation
- grid computing
- information sharing
- network management
- load balancing
- distributed computing
- wireless sensor networks
- computing resources
- network traffic
- virtual organization
- pareto optimal
- business process
- envy free