Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut

被引：0
|
作者：
机构：
来源：
Journal of Parallel and Distributed Computing | / 46卷 / 01期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] APPROXIMATION ALGORITHMS FOR SCHEDULING PARALLEL JOBS
    Jansen, Klaus
    Thoele, Ralf
    SIAM JOURNAL ON COMPUTING, 2010, 39 (08) : 3571 - 3615
  • [22] SUCCESSIVE APPROXIMATION IN PARALLEL GRAPH ALGORITHMS
    FUSSELL, D
    THURIMELLA, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 205 - 217
  • [23] SUCCESSIVE APPROXIMATION IN PARALLEL GRAPH ALGORITHMS
    FUSSELL, D
    THURIMELLA, R
    THEORETICAL COMPUTER SCIENCE, 1990, 74 (01) : 19 - 35
  • [24] Distributed approximation algorithms for planar graphs
    Czygrinow, Andrzej
    Hanckowiak, Michal
    Szymanska, Edyta
    ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2006, 3998 : 296 - 307
  • [25] Information-theoretic Analysis of MAXCUT Algorithms
    Bian, Yatao
    Gronskiy, Alexey
    Buhmann, Joachim M.
    2016 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA), 2016,
  • [26] Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for VLSI applications
    Sung Kyun Kwan Univ, Suwon, Korea, Republic of
    IEEE Trans Comput, 11 (1253-1266):
  • [27] Factorial design analysis applied to the performance of parallel evolutionary algorithms
    Pais, Mônica S
    Peretta, Igor S
    Yamanaka, Keiji
    Pinto, Edmilson R
    Journal of the Brazilian Computer Society, 2014, 20 (01) : 1 - 17
  • [28] Boosting Algorithms for Parallel and Distributed Learning
    Aleksandar Lazarevic
    Zoran Obradovic
    Distributed and Parallel Databases, 2002, 11 : 203 - 229
  • [29] Boosting algorithms for parallel and distributed learning
    Lazarevic, A
    Obradovic, Z
    DISTRIBUTED AND PARALLEL DATABASES, 2002, 11 (02) : 203 - 229
  • [30] Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for VLSI applications
    Cho, JD
    Raje, S
    Sarrafzadeh, M
    IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (11) : 1253 - 1266
12345