A subset-sum inequality

被引：0
|
作者：
Stong, R [1 ]
机构：
[1] Rice Univ, Houston, TX 77251 USA
来源：
AMERICAN MATHEMATICAL MONTHLY | 2006年 / 113卷 / 03期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：269 / 270
页数：2
相关论文
共 50 条
  • [31] An efficient fully polynomial approximation scheme for the Subset-Sum Problem
    Kellerer, H
    Mansini, R
    Pferschy, U
    Speranza, MG
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 66 (02) : 349 - 370
  • [32] A low-space algorithm for the subset-sum problem on GPU
    Curtis, V. V.
    Sanches, C. A. A.
    COMPUTERS & OPERATIONS RESEARCH, 2017, 83 : 120 - 124
  • [33] AN ALMOST LINEAR-TIME ALGORITHM FOR THE DENSE SUBSET-SUM PROBLEM
    GALIL, Z
    MARGALIT, O
    SIAM JOURNAL ON COMPUTING, 1991, 20 (06) : 1157 - 1189
  • [34] Parallel time and space upper-bounds for the subset-sum problem
    Sanches, C. A. A.
    Soma, N. Y.
    Yanasse, H. H.
    THEORETICAL COMPUTER SCIENCE, 2008, 407 (1-3) : 342 - 348
  • [35] WORST-CASE ANALYSIS OF AN APPROXIMATION SCHEME FOR THE SUBSET-SUM PROBLEM
    FISCHETTI, M
    OPERATIONS RESEARCH LETTERS, 1986, 5 (06) : 283 - 284
  • [36] WORST-CASE ANALYSIS OF GREEDY ALGORITHMS FOR THE SUBSET-SUM PROBLEM
    MARTELLO, S
    TOTH, P
    MATHEMATICAL PROGRAMMING, 1984, 28 (02) : 198 - 205
  • [37] Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem
    Güntzer, MM
    Jungnickel, D
    OPERATIONS RESEARCH LETTERS, 2000, 26 (02) : 55 - 66
  • [38] Subset-sum Based Relay Selection for Multipath TCP in Cooperative LTE Networks
    Zhou, Dizhi
    Song, Wei
    Ju, Peijian
    2013 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2013, : 4735 - 4740
  • [39] An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
    Sanches, C. A. A.
    Soma, N. Y.
    Yanasse, H. H.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (02) : 870 - 879
  • [40] A MIXTURE OF DYNAMIC-PROGRAMMING AND BRANCH-AND-BOUND FOR THE SUBSET-SUM PROBLEM
    MARTELLO, S
    TOTH, P
    MANAGEMENT SCIENCE, 1984, 30 (06) : 765 - 771
12345