GENERAL APPROXIMATION ALGORITHMS FOR SOME ARITHMETICAL COMBINATORIAL PROBLEMS

被引：6

|

作者：

MORAN, S

机构：

来源：

THEORETICAL COMPUTER SCIENCE | 1981年 / 14卷 / 03期

关键词：

D O I：

10.1016/0304-3975(81)90047-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：289 / 303

页数：15

相关论文

共 50 条

[41] Approximation algorithms for some position-dependent scheduling problems
Yang, Liya
Lu, Xiwen
DISCRETE APPLIED MATHEMATICS, 2021, 289 : 22 - 31
[42] Approximation algorithms for some optimum communication spanning tree problems
Wu, BY
Chao, KM
Tang, CY
DISCRETE APPLIED MATHEMATICS, 2000, 102 (03) : 245 - 266
[43] SOME ALGEBRAIC PROBLEMS IN CONNECTION WITH GENERAL EIGENVALUE ALGORITHMS
ELSNER, L
LINEAR ALGEBRA AND ITS APPLICATIONS, 1979, 26 (AUG) : 123 - 138
[44] A BRIEF INTRODUCTION TO EXACT, APPROXIMATION, AND HEURISTIC ALGORITHMS FOR SOLVING HARD COMBINATORIAL OPTIMIZATION PROBLEMS
Festa, P.
2014 16TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON), 2014,
[45] Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
Lee, Timothy
Mitchell, John E.
DISCRETE OPTIMIZATION, 2017, 24 : 152 - 169
[46] SOME COMBINATORIAL PROBLEMS
AKIYAMA, J
HOSONO, K
URABE, M
DISCRETE MATHEMATICS, 1993, 116 (1-3) : 291 - 298
[47] Some Combinatorial Problems (Ⅰ)
徐利治
数学研究与评论, 1987, (01) : 157 - 160
[48] Approximation algorithms for general packing problems and their application to the multicast congestion problem
Jansen, Klaus
Zhang, Hu
MATHEMATICAL PROGRAMMING, 2008, 114 (01) : 183 - 206
[49] Approximation algorithms for general packing problems with modified logarithmic potential function
Jansen, K
Zhang, H
FOUNDATIONS OF INFORMATION TECHNOLOGY IN THE ERA OF NETWORK AND MOBILE COMPUTING, 2002, 96 : 255 - 266
[50] Approximation algorithms for general packing problems with modified logarithmic potential function
Jansen, Klaus
Zhang, Hu
IFIP Advances in Information and Communication Technology, 2002, 96 : 255 - 266

← 1 2 3 4 5 →