Approximability of the problem about a minimum-weight cycle cover of a graph

被引:0
|
作者
M. Yu. Khachai
E. D. Neznakhina
机构
[1] Russian Academy of Sciences,Krasovskii Institute of Mathematics and Mechanics, Ural Branch
[2] Ural Federal University,undefined
来源
Doklady Mathematics | 2015年 / 91卷
关键词
Travel Salesman Problem; Travel Salesman Problem; DOKLADY Mathematic; Hamiltonian Cycle; Polynomial Time Approximation Scheme;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:240 / 245
页数:5
相关论文
共 50 条
  • [1] Approximability of the problem about a minimum-weight cycle cover of a graph
    Khachai, M. Yu.
    Neznakhina, E. D.
    DOKLADY MATHEMATICS, 2015, 91 (02) : 240 - 245
  • [2] Approximability of the minimum-weight k-size cycle cover problem
    Khachay, Michael
    Neznakhina, Katherine
    JOURNAL OF GLOBAL OPTIMIZATION, 2016, 66 (01) : 65 - 82
  • [3] Approximability of the minimum-weight k-size cycle cover problem
    Michael Khachay
    Katherine Neznakhina
    Journal of Global Optimization, 2016, 66 : 65 - 82
  • [4] Minimum-weight cycle covers and their approximability
    Manthey, Bodo
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (07) : 1470 - 1480
  • [5] Minimum-weight cycle covers and their approximability
    Manthey, Bodo
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2007, 4769 : 178 - +
  • [6] APPROXIMABILITY OF THE MINIMUM STEINER CYCLE PROBLEM
    Steinova, Monika
    COMPUTING AND INFORMATICS, 2010, 29 (06) : 1349 - 1357
  • [7] The Longest Minimum-Weight Path in a Complete Graph
    Addario-Berry, Louigi
    Broutin, Nicolas
    Lugosi, Gabor
    COMBINATORICS PROBABILITY & COMPUTING, 2010, 19 (01): : 1 - 19
  • [8] On the approximability of the minimum fundamental cycle basis problem
    Galbiati, G
    Amaldi, E
    APPROXIMATION AND ONLINE ALGORITHMS, 2004, 2909 : 151 - 164
  • [9] MINIMUM-WEIGHT VERTEX COVER PROBLEM FOR 2-CLASS RESOURCE CONNECTION GRAPHS
    CHEN, JSJ
    LI, VOK
    INFORMATION SCIENCES, 1993, 74 (1-2) : 53 - 71
  • [10] A GREEDY HEURISTIC FOR A MINIMUM-WEIGHT FOREST PROBLEM
    IMIELINSKA, C
    KALANTARI, B
    KHACHIYAN, L
    OPERATIONS RESEARCH LETTERS, 1993, 14 (02) : 65 - 71