IMPROVED PROCESSOR BOUNDS FOR COMBINATORIAL PROBLEMS IN RNC

被引：12
|
作者：
GALIL, Z
PAN, V
机构：
[1] COLUMBIA UNIV,DEPT COMP SCI,NEW YORK,NY 10027
[2] COLUMBIA UNIV,DEPT COMP SCI,NEW YORK,NY 10027
[3] TEL AVIV UNIV,IL-69978 TEL AVIV,ISRAEL
来源：
COMBINATORICA | 1988年 / 8卷 / 02期
关键词：
D O I：
10.1007/BF02122800
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：189 / 200
页数：12
相关论文
共 50 条
  • [1] LOWER BOUNDS FOR COMBINATORIAL PROBLEMS ON GRAPHS
    NAKAYAMA, H
    NISHIZEKI, T
    SAITO, N
    JOURNAL OF ALGORITHMS, 1985, 6 (03) : 393 - 399
  • [2] Improved Regret Bounds for Bandit Combinatorial Optimization
    Ito, Shinji
    Hatano, Daisuke
    Sumita, Hanna
    Takemura, Kei
    Fukunaga, Takuro
    Kakimura, Naonori
    Kawarabayashi, Ken-ichi
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [3] Design and implementation of reconfigurable processor for problems of combinatorial computations
    Skliarova, I
    Ferrari, AB
    EUROMICRO SYMPOSIUM ON DIGITAL SYSTEMS DESIGN, PROCEEDINGS, 2001, : 112 - 119
  • [4] The design and implementation of a reconfigurable processor for problems of combinatorial computation
    Skliarova, I
    Ferrari, AB
    JOURNAL OF SYSTEMS ARCHITECTURE, 2003, 49 (4-6) : 211 - 226
  • [5] Data reductions and combinatorial bounds for improved approximation algorithms
    Abu-Khzam, Faisal N.
    Bazgan, Cristina
    Chopin, Morgan
    Fernau, Henning
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2016, 82 (03) : 503 - 520
  • [6] Bounds and bound sets for biobjective combinatorial optimization problems
    Ehrgott, M
    Gandibleux, X
    MULTIPLE CRITERIA DECISION MAKING IN THE NEW MILLENNIUM, 2001, 507 : 241 - 253
  • [7] Decorous combinatorial lower bounds for row layout problems
    Dahlbeck, Mirko
    Fischer, Anja
    Fischer, Frank
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 286 (03) : 929 - 944
  • [8] RNC algorithms for the uniform generation of combinatorial structures
    Zito, M
    Pu, I
    Amos, M
    Gibbons, A
    PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 429 - 437
  • [9] BOUNDS OF THE COMPLEXITY OF COMBINATORIAL OPTIMIZATION PROBLEMS IN ONE CLASS OF ALGORITHMS
    BONDARENKO, VA
    DOKLADY AKADEMII NAUK, 1993, 328 (01) : 22 - 24
  • [10] Improved combinatorial algorithms for facility location problems
    Charikar, M
    Guha, S
    SIAM JOURNAL ON COMPUTING, 2005, 34 (04) : 803 - 824
12345