Non-oblivious local search for graph and hypergraph coloring problems

被引：0
|
作者：
Alimonti, P
机构：
来源：
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE | 1995年 / 1017卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：167 / 180
页数：14
相关论文
共 50 条
  • [1] Heuristics for improving the non-oblivious local search for MaxSAT
    De Ita, G
    Pinto, DE
    Nuño, M
    [J]. PROGRESS IN ARTIFICIAL INTELLIGENCE-IBERAMIA 98, 1998, 1484 : 219 - 229
  • [2] Uniform unweighted set cover: The power of non-oblivious local search
    Levin, Asaf
    Yovel, Uri
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (12-14) : 1033 - 1053
  • [3] MONOTONE SUBMODULAR MAXIMIZATION OVER A MATROID VIA NON-OBLIVIOUS LOCAL SEARCH
    Filmus, Yuval
    Ward, Justin
    [J]. SIAM JOURNAL ON COMPUTING, 2014, 43 (02) : 514 - 542
  • [4] Separating oblivious and non-oblivious BPs
    Iwama, K
    Okabe, Y
    Takase, T
    [J]. COMPUTING AND COMBINATORICS, 2001, 2108 : 28 - 38
  • [5] Non-oblivious Strategy Improvement
    Fearnley, John
    [J]. LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING (LPAR-16), 2010, 6355 : 212 - 230
  • [6] Gathering non-oblivious mobile robots
    Cieliebak, M
    [J]. LATIN 2004: THEORETICAL INFORMATICS, 2004, 2976 : 577 - 588
  • [7] Dimension, graph and hypergraph coloring
    Felsner, S
    Trotter, WT
    [J]. ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2000, 17 (02): : 167 - 177
  • [8] Dimension, Graph and Hypergraph Coloring
    Stefan Felsner
    William T. Trotter
    [J]. Order, 2000, 17 : 167 - 177
  • [9] Preservation of Normality by Non-Oblivious Group Selection
    Carton, Olivier
    Vandehey, Joseph
    [J]. THEORY OF COMPUTING SYSTEMS, 2021, 65 (02) : 241 - 256
  • [10] Fast Ranking with Additive Ensembles of Oblivious and Non-Oblivious Regression Trees
    Dato, Domenico
    Lucchese, Claudio
    Nardini, Franco Maria
    Orlando, Salvatore
    Perego, Raffaele
    Tonellotto, Nicola
    Venturini, Rossano
    [J]. ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2016, 35 (02)
12345