Envy-Free Resource Sharing on a Temporal Network Using a Minimum Cost Circulation Problem

Ryo HASE; Mitsue IMAHORI; Norihiko SHINOMIYA

doi:10.1587/transfun.2020map0010

Envy-Free Resource Sharing on a Temporal Network Using a Minimum Cost Circulation Problem

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.2020map0010 ◽

2021 ◽

Vol E104.A (2) ◽

pp. 462-473

Author(s):

Ryo HASE ◽

Mitsue IMAHORI ◽

Norihiko SHINOMIYA

Keyword(s):

Resource Sharing ◽

Minimum Cost ◽

Temporal Network ◽

Minimum Cost Circulation ◽

Free Resource ◽

Circulation Problem

Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem

10.21236/ada215109 ◽

1988 ◽

Author(s):

Robert E. Tarjan

Keyword(s):

Minimum Cost ◽

Simplex Algorithm ◽

Minimum Cost Circulation ◽

Network Simplex Algorithm ◽

Network Simplex ◽

Circulation Problem

Algorithms for the minimum cost circulation problem based on maximizing the mean improvement

Operations Research Letters ◽

10.1016/0167-6377(92)90048-8 ◽

1992 ◽

Vol 12 (4) ◽

pp. 227-233 ◽

Cited By ~ 7

Author(s):

Refael Hassin

Keyword(s):

Minimum Cost ◽

Minimum Cost Circulation ◽

The Mean ◽

Circulation Problem

Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem

Mathematics of Operations Research ◽

10.1287/moor.16.2.272 ◽

1991 ◽

Vol 16 (2) ◽

pp. 272-291 ◽

Cited By ~ 11

Author(s):

Robert E. Tarjan

Keyword(s):

Minimum Cost ◽

Simplex Algorithm ◽

Minimum Cost Circulation ◽

Network Simplex Algorithm ◽

Network Simplex ◽

Circulation Problem

A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm

Mathematical Programming ◽

10.1007/bf01580882 ◽

1986 ◽

Vol 35 (3) ◽

pp. 298-308 ◽

Cited By ~ 28

Author(s):

Satoru Fujishige

Keyword(s):

Minimum Cost ◽

Minimum Cost Circulation ◽

Circulation Problem ◽

Rounding Algorithm

Minimum Cost Multicommodity Circulation Problem with Convex Arc-Costs

Transportation Science ◽

10.1287/trsc.8.4.355 ◽

1974 ◽

Vol 8 (4) ◽

pp. 355-360 ◽

Cited By ~ 6

Author(s):

Jacques A. Ferland

Keyword(s):

Minimum Cost ◽

Circulation Problem

Note on Weintraub’s Minimum-Cost Circulation Algorithm

SIAM Journal on Computing ◽

10.1137/0218039 ◽

1989 ◽

Vol 18 (3) ◽

pp. 579-583 ◽

Cited By ~ 17

Author(s):

Francisco Barahona ◽

éva Tardos

Keyword(s):

Minimum Cost ◽

Minimum Cost Circulation

A minimum-cost circulation approach to DSP address-code generation

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems ◽

10.1109/43.766724 ◽

1999 ◽

Vol 18 (6) ◽

pp. 726-741 ◽

Cited By ~ 4

Author(s):

C.H. Gebotys

Keyword(s):

Code Generation ◽

Minimum Cost ◽

Minimum Cost Circulation

Efficient Global Multi-object Tracking Under Minimum-cost Circulation Framework

IEEE Transactions on Pattern Analysis and Machine Intelligence ◽

10.1109/tpami.2020.3026257 ◽

2020 ◽

pp. 1-1

Author(s):

Congchao Wang ◽

Yizhi Wang ◽

Guoqiang Yu

Keyword(s):

Object Tracking ◽

Minimum Cost ◽

Minimum Cost Circulation

A strongly polynomial minimum cost circulation algorithm

COMBINATORICA ◽

10.1007/bf02579369 ◽

1985 ◽

Vol 5 (3) ◽

pp. 247-255 ◽

Cited By ~ 184

Author(s):

Éva Tardos

Keyword(s):

Minimum Cost ◽

Minimum Cost Circulation ◽

Strongly Polynomial

DSP address optimization using a minimum cost circulation technique

Proceedings of IEEE International Conference on Computer Aided Design (ICCAD) ICCAD-97 ◽

10.1109/iccad.1997.643380 ◽

1997 ◽

Cited By ~ 22

Author(s):

Gebotys

Keyword(s):

Minimum Cost ◽

Minimum Cost Circulation