COMPLEXITY OF APPROXIMATE SOLUTION OF COMBINATORIAL PROBLEMS

被引:0
|
作者
NIGMATULLIN, RG [1 ]
机构
[1] VI LENIN STATE UNIV,KAZAN,USSR
来源
DOKLADY AKADEMII NAUK SSSR | 1975年 / 224卷 / 02期
关键词
D O I
暂无
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
引用
收藏
页码:289 / 292
页数:4
相关论文
共 50 条
  • [1] EXACT AND APPROXIMATE SOLUTION OF CONSTRAINED DYNAMIC COMBINATORIAL PROBLEMS IN SPACE
    KUENNE, RE
    JOURNAL OF REGIONAL SCIENCE, 1972, 12 (01) : 1 - 22
  • [3] ONE APPROACH TO EXPERIMENTAL COMPARISON OF ALGORITHMS FOR APPROXIMATE SOLUTION OF LOGIC-COMBINATORIAL PROBLEMS
    LINABERG, LJ
    MARTINSONS, JJ
    AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1987, (04): : 88 - 88
  • [4] On the computational complexity of combinatorial flexibility problems
    Leoni, V. A.
    Nasini, G. L.
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2010, 87 (15) : 3330 - 3343
  • [5] Quantum approximate optimization for combinatorial problems with constraints
    Ruan, Yue
    Yuan, Zhiqiang
    Xue, Xiling
    Liu, Zhihao
    INFORMATION SCIENCES, 2023, 619 : 98 - 125
  • [6] The relative complexity of approximate counting problems
    Dyer, M
    Goldberg, LA
    Greenhill, C
    Jerrum, M
    ALGORITHMICA, 2004, 38 (03) : 471 - 500
  • [7] The Relative Complexity of Approximate Counting Problems
    Martin Dyer
    Leslie Ann Goldberg
    Catherine Greenhill
    Mark Jerrum
    Algorithmica , 2004, 38 : 471 - 500
  • [8] Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches
    Fujishima, Yuzo
    Leyton-Brown, Kevin
    Shoham, Yoav
    IJCAI International Joint Conference on Artificial Intelligence, 1999, 1 : 548 - 553
  • [9] Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches
    Fujishima, Y
    Leyton-Brown, K
    Shoham, Y
    IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2, 1999, : 548 - 553
  • [10] THE APPROXIMATE SOLUTION OF MATRIX PROBLEMS
    HOUSEHOLDER, AS
    JOURNAL OF THE ACM, 1958, 5 (03) : 205 - 243