FINDING THE WEIGHTED MINIMAX FLOW IN A POLYNOMIAL-TIME

被引:9
|
作者
ICHIMORI, T [1 ]
ISHII, H [1 ]
NISHIDA, T [1 ]
机构
[1] OSAKA UNIV,FAC ENGN,DEPT APPL PHYS,SUITA,OSAKA 565,JAPAN
关键词
D O I
10.15807/jorsj.23.268
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:268 / 272
页数:5
相关论文
共 50 条
  • [1] FINDING SYLOW NORMALIZERS IN POLYNOMIAL-TIME
    KANTOR, WM
    JOURNAL OF ALGORITHMS, 1990, 11 (04) : 523 - 563
  • [2] A polynomial-time algorithm for finding ε in DEA models
    Amin, GR
    Toloo, M
    COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (05) : 803 - 805
  • [3] A polynomial-time algorithm for finding zero-sums
    del Lungo, Alberto
    Marini, Claudio
    Mori, Elisa
    DISCRETE MATHEMATICS, 2009, 309 (09) : 2658 - 2662
  • [4] A POLYNOMIAL-TIME ALGORITHM FOR FINDING THE ABSOLUTE CENTER OF A NETWORK
    MINIEKA, E
    NETWORKS, 1981, 11 (04) : 351 - 355
  • [5] Polynomial-Time Approximation Algorithms for Weighted LCS Problem
    Cygan, Marek
    Kubica, Marcin
    Radoszewski, Jakub
    Rytter, Wojciech
    Walen, Tomasz
    COMBINATORIAL PATTERN MATCHING, 22ND ANNUAL SYMPOSIUM, CPM 2011, 2011, 6661 : 455 - 466
  • [6] Minimax games, spin glasses, and the polynomial-time hierarchy of complexity classes
    Varga, P
    PHYSICAL REVIEW E, 1998, 57 (06): : 6487 - 6492
  • [7] Polynomial-time approximation algorithms for weighted LCS problem
    Cygan, M.
    Kubica, M.
    Radoszewski, J.
    Rytter, W.
    Walen, T.
    DISCRETE APPLIED MATHEMATICS, 2016, 204 : 38 - 48
  • [8] Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
    Joshua A. Grochow
    Theory of Computing Systems, 2023, 67 : 627 - 669
  • [9] Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
    Grochow, Joshua A.
    THEORY OF COMPUTING SYSTEMS, 2023, 67 (03) : 627 - 669
  • [10] A POLYNOMIAL-TIME SOLVABLE CONCAVE NETWORK FLOW PROBLEM
    GUISEWITE, GM
    PARDALOS, PM
    NETWORKS, 1993, 23 (02) : 143 - 147