首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
FINDING THE WEIGHTED MINIMAX FLOW IN A POLYNOMIAL-TIME
被引:9
|
作者
:
ICHIMORI, T
论文数:
0
引用数:
0
h-index:
0
机构:
OSAKA UNIV,FAC ENGN,DEPT APPL PHYS,SUITA,OSAKA 565,JAPAN
OSAKA UNIV,FAC ENGN,DEPT APPL PHYS,SUITA,OSAKA 565,JAPAN
ICHIMORI, T
[
1
]
ISHII, H
论文数:
0
引用数:
0
h-index:
0
机构:
OSAKA UNIV,FAC ENGN,DEPT APPL PHYS,SUITA,OSAKA 565,JAPAN
OSAKA UNIV,FAC ENGN,DEPT APPL PHYS,SUITA,OSAKA 565,JAPAN
ISHII, H
[
1
]
NISHIDA, T
论文数:
0
引用数:
0
h-index:
0
机构:
OSAKA UNIV,FAC ENGN,DEPT APPL PHYS,SUITA,OSAKA 565,JAPAN
OSAKA UNIV,FAC ENGN,DEPT APPL PHYS,SUITA,OSAKA 565,JAPAN
NISHIDA, T
[
1
]
机构
:
[1]
OSAKA UNIV,FAC ENGN,DEPT APPL PHYS,SUITA,OSAKA 565,JAPAN
来源
:
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN
|
1980年
/ 23卷
/ 03期
关键词
:
D O I
:
10.15807/jorsj.23.268
中图分类号
:
C93 [管理学];
O22 [运筹学];
学科分类号
:
070105 ;
12 ;
1201 ;
1202 ;
120202 ;
摘要
:
引用
收藏
页码:268 / 272
页数:5
相关论文
共 50 条
[31]
A POLYNOMIAL-TIME ALGORITHM FOR FINDING THE PRIME FACTORS OF CARTESIAN-PRODUCT GRAPHS
FEIGENBAUM, J
论文数:
0
引用数:
0
h-index:
0
机构:
AT&T BELL LABS,MURRAY HILL,NJ 07974
AT&T BELL LABS,MURRAY HILL,NJ 07974
FEIGENBAUM, J
HERSHBERGER, J
论文数:
0
引用数:
0
h-index:
0
机构:
AT&T BELL LABS,MURRAY HILL,NJ 07974
AT&T BELL LABS,MURRAY HILL,NJ 07974
HERSHBERGER, J
SCHAFFER, AA
论文数:
0
引用数:
0
h-index:
0
机构:
AT&T BELL LABS,MURRAY HILL,NJ 07974
AT&T BELL LABS,MURRAY HILL,NJ 07974
SCHAFFER, AA
DISCRETE APPLIED MATHEMATICS,
1985,
12
(02)
: 123
-
138
[32]
POLYNOMIAL-TIME ALGORITHMS FOR FINDING ELEMENTS OF PRIME-ORDER AND SYLOW SUBGROUPS
KANTOR, WM
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV OREGON, DEPT MATH, EUGENE, OR 97403 USA
UNIV OREGON, DEPT MATH, EUGENE, OR 97403 USA
KANTOR, WM
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC,
1985,
6
(04):
: 478
-
514
[33]
Polynomial-time data reduction for weighted problems beyond additive goal functions
Bentert, Matthias
论文数:
0
引用数:
0
h-index:
0
机构:
Tech Univ Berlin, Fac 4, Algorithm & Computat Complex, Berlin, Germany
Tech Univ Berlin, Fac 4, Algorithm & Computat Complex, Berlin, Germany
Bentert, Matthias
van Bevern, Rene
论文数:
0
引用数:
0
h-index:
0
机构:
Huawei Technol Co Ltd, Dusseldorf, Germany
Tech Univ Berlin, Fac 4, Algorithm & Computat Complex, Berlin, Germany
van Bevern, Rene
Fluschnik, Till
论文数:
0
引用数:
0
h-index:
0
机构:
Tech Univ Berlin, Fac 4, Algorithm & Computat Complex, Berlin, Germany
Tech Univ Berlin, Fac 4, Algorithm & Computat Complex, Berlin, Germany
Fluschnik, Till
Nichterlein, Andre
论文数:
0
引用数:
0
h-index:
0
机构:
Tech Univ Berlin, Fac 4, Algorithm & Computat Complex, Berlin, Germany
Tech Univ Berlin, Fac 4, Algorithm & Computat Complex, Berlin, Germany
Nichterlein, Andre
Niedermeier, Rolf
论文数:
0
引用数:
0
h-index:
0
机构:
Tech Univ Berlin, Fac 4, Algorithm & Computat Complex, Berlin, Germany
Tech Univ Berlin, Fac 4, Algorithm & Computat Complex, Berlin, Germany
Niedermeier, Rolf
DISCRETE APPLIED MATHEMATICS,
2023,
328
: 117
-
133
[34]
A Randomized Fully Polynomial-time Approximation Scheme for Weighted Perfect Matching in the Plane
Abd El-Latif, Yasser M.
论文数:
0
引用数:
0
h-index:
0
机构:
Ain Shams Univ, Fac Sci, Cairo, Egypt
Ain Shams Univ, Fac Sci, Cairo, Egypt
Abd El-Latif, Yasser M.
Ali, Salwa M.
论文数:
0
引用数:
0
h-index:
0
机构:
Ain Shams Univ, Fac Sci, Cairo, Egypt
Ain Shams Univ, Fac Sci, Cairo, Egypt
Ali, Salwa M.
Essa, Hanaa A. E.
论文数:
0
引用数:
0
h-index:
0
机构:
Tanta Univ, Fac Sci, Tanta, Egypt
Ain Shams Univ, Fac Sci, Cairo, Egypt
Essa, Hanaa A. E.
Khamis, Soheir M.
论文数:
0
引用数:
0
h-index:
0
机构:
Ain Shams Univ, Fac Sci, Cairo, Egypt
Ain Shams Univ, Fac Sci, Cairo, Egypt
Khamis, Soheir M.
INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS,
2012,
3
(11)
: 139
-
144
[35]
LINK SCHEDULING IN POLYNOMIAL-TIME
HAJEK, B
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV ILLINOIS,COORDINATED SCI LAB,URBANA,IL 61801
UNIV ILLINOIS,COORDINATED SCI LAB,URBANA,IL 61801
HAJEK, B
SASAKI, G
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV ILLINOIS,COORDINATED SCI LAB,URBANA,IL 61801
UNIV ILLINOIS,COORDINATED SCI LAB,URBANA,IL 61801
SASAKI, G
IEEE TRANSACTIONS ON INFORMATION THEORY,
1988,
34
(05)
: 910
-
917
[36]
Structure of Polynomial-Time Approximation
van Leeuwen, Erik Jan
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Bergen, Dept Informat, N-5020 Bergen, Norway
Univ Utrecht, Dept Informat & Comp Sci, NL-3584 CC Utrecht, Netherlands
van Leeuwen, Erik Jan
van Leeuwen, Jan
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Utrecht, Dept Informat & Comp Sci, NL-3584 CC Utrecht, Netherlands
Univ Utrecht, Dept Informat & Comp Sci, NL-3584 CC Utrecht, Netherlands
van Leeuwen, Jan
THEORY OF COMPUTING SYSTEMS,
2012,
50
(04)
: 641
-
674
[37]
On Polynomial-Time Relation Reducibility
Gao, Su
论文数:
0
引用数:
0
h-index:
0
机构:
Univ North Texas, Dept Math, Denton, TX 76203 USA
Univ North Texas, Dept Math, Denton, TX 76203 USA
Gao, Su
Ziegler, Caleb
论文数:
0
引用数:
0
h-index:
0
机构:
Univ North Texas, Dept Math, Denton, TX 76203 USA
Univ North Texas, Dept Math, Denton, TX 76203 USA
Ziegler, Caleb
NOTRE DAME JOURNAL OF FORMAL LOGIC,
2017,
58
(02)
: 271
-
285
[38]
ON THE POWER OF PARITY POLYNOMIAL-TIME
CAI, JY
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV ROCHESTER, DEPT COMP SCI, ROCHESTER, NY 14627 USA
UNIV ROCHESTER, DEPT COMP SCI, ROCHESTER, NY 14627 USA
CAI, JY
HEMACHANDRA, LA
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV ROCHESTER, DEPT COMP SCI, ROCHESTER, NY 14627 USA
UNIV ROCHESTER, DEPT COMP SCI, ROCHESTER, NY 14627 USA
HEMACHANDRA, LA
MATHEMATICAL SYSTEMS THEORY,
1990,
23
(02):
: 95
-
106
[39]
ON THE STRUCTURE OF POLYNOMIAL-TIME DEGREES
AMBOSSPIES, K
论文数:
0
引用数:
0
h-index:
0
AMBOSSPIES, K
LECTURE NOTES IN COMPUTER SCIENCE,
1984,
166
: 198
-
208
[40]
An arithmetic for polynomial-time computation
Schwichtenberg, Helmut
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Munich, Math Inst, D-80333 Munich, Germany
Univ Munich, Math Inst, D-80333 Munich, Germany
Schwichtenberg, Helmut
THEORETICAL COMPUTER SCIENCE,
2006,
357
(1-3)
: 202
-
214
←
1
2
3
4
5
→