咨询与建议

限定检索结果

文献类型

  • 22,811 篇 会议
  • 9,086 篇 期刊文献
  • 64 篇 学位论文
  • 1 册 图书

馆藏范围

  • 31,962 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 15,965 篇 工学
    • 10,069 篇 计算机科学与技术...
    • 4,864 篇 电气工程
    • 3,097 篇 软件工程
    • 2,689 篇 信息与通信工程
    • 1,952 篇 控制科学与工程
    • 737 篇 机械工程
    • 681 篇 电子科学与技术(可...
    • 605 篇 航空宇航科学与技...
    • 532 篇 仪器科学与技术
    • 232 篇 交通运输工程
    • 212 篇 材料科学与工程(可...
    • 195 篇 化学工程与技术
    • 171 篇 生物工程
    • 147 篇 测绘科学与技术
    • 134 篇 动力工程及工程热...
    • 134 篇 生物医学工程(可授...
    • 133 篇 土木工程
  • 10,418 篇 理学
    • 9,357 篇 数学
    • 874 篇 物理学
    • 766 篇 系统科学
    • 742 篇 统计学(可授理学、...
    • 265 篇 生物学
    • 235 篇 化学
  • 2,485 篇 管理学
    • 1,929 篇 管理科学与工程(可...
    • 672 篇 工商管理
    • 554 篇 图书情报与档案管...
  • 418 篇 经济学
    • 387 篇 应用经济学
  • 207 篇 医学
    • 171 篇 临床医学
  • 179 篇 法学
    • 166 篇 社会学
  • 128 篇 文学
    • 123 篇 新闻传播学
  • 128 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 31,962 篇 approximation al...
  • 2,737 篇 algorithm design...
  • 2,333 篇 optimization
  • 2,306 篇 approximation me...
  • 2,156 篇 heuristic algori...
  • 1,421 篇 linear programmi...
  • 1,403 篇 convergence
  • 1,272 篇 computational mo...
  • 1,216 篇 resource managem...
  • 1,137 篇 signal processin...
  • 955 篇 computer science
  • 910 篇 polynomials
  • 906 篇 clustering algor...
  • 905 篇 complexity theor...
  • 789 篇 mathematical mod...
  • 741 篇 vectors
  • 712 篇 programming
  • 647 篇 estimation
  • 614 篇 transportation
  • 608 篇 training

机构

  • 97 篇 univ maryland de...
  • 70 篇 technion israel ...
  • 55 篇 univ waterloo de...
  • 49 篇 cornell univ dep...
  • 43 篇 tsinghua univers...
  • 39 篇 national institu...
  • 39 篇 carnegie mellon ...
  • 38 篇 iit dept comp sc...
  • 35 篇 national mobile ...
  • 34 篇 shandong univ sc...
  • 32 篇 sichuan univ col...
  • 31 篇 school of comput...
  • 31 篇 nanjing univ sta...
  • 29 篇 univ chinese aca...
  • 29 篇 technion haifa
  • 29 篇 princeton univ p...
  • 29 篇 suny stony brook...
  • 28 篇 epfl
  • 28 篇 tel aviv univers...
  • 28 篇 max planck inst ...

作者

  • 64 篇 woodruff david p...
  • 64 篇 ravi r.
  • 52 篇 kortsarz guy
  • 45 篇 lee euiwoong
  • 43 篇 levin asaf
  • 41 篇 chan timothy m.
  • 40 篇 kumar amit
  • 37 篇 chen zhi-zhong
  • 36 篇 friggstad zachar...
  • 33 篇 kawarabayashi ke...
  • 32 篇 manurangsi pasin
  • 32 篇 chalermsook pari...
  • 31 篇 wang lusheng
  • 30 篇 gudmundsson joac...
  • 29 篇 thai my t.
  • 29 篇 williamson david...
  • 29 篇 carmi paz
  • 29 篇 zenklusen rico
  • 28 篇 saha barna
  • 27 篇 dinitz michael

语言

  • 31,238 篇 英文
  • 576 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
31962 条 记 录,以下是591-600 订阅
排序:
A note on improving the performance of approximation algorithms for radiation therapy
收藏 引用
INFORMATION PROCESSING LETTERS 2011年 第7期111卷 326-333页
作者: Biedl, Therese Durocher, Stephane Hoos, Holger H. Luan, Shuang Saia, Jared Young, Maxwell Univ Waterloo David R Cheriton Sch Comp Sci Waterloo ON N2L 3G1 Canada Univ Manitoba Dept Comp Sci Winnipeg MB R3T 2N2 Canada Univ British Columbia Dept Comp Sci Vancouver BC V5Z 1M9 Canada Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes in each row are consecutive. This has... 详细信息
来源: 评论
Better approximation algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT
收藏 引用
INFORMATION PROCESSING LETTERS 1998年 第6期65卷 305-311页
作者: Andersson, G Engebretsen, L Royal Inst Technol Dept Numer Anal & Comp Sci S-10044 Stockholm Sweden
We construct new approximation algorithms for MAX SET SPLITTING and MAX NOT-ALL-EQUAL SAT which when combined with existing algorithms give the best approximation results so far for these problems. Furthermore, we sol... 详细信息
来源: 评论
Partitioning a square into rectangles: NP-completeness and approximation algorithms
收藏 引用
ALGORITHMICA 2002年 第3期34卷 217-239页
作者: Beaumont, O Boudet, V Rastello, F Robert, Y Ecole Normale Super Lyon CNRS LIP UMRINRIA 5668 F-69364 Lyon 07 France
In this paper we deal with two geometric problems arising from heterogeneous parallel computing: how to partition the unit square into p rectangles of given areas s(1), s(2), ... s(p) (such that Sigma(i=l)(p) s(i) = l... 详细信息
来源: 评论
Improved approximation algorithms for cumulative VRP with stochastic demands
收藏 引用
DISCRETE APPLIED MATHEMATICS 2020年 280卷 133-143页
作者: Gaur, Daya Ram Mudgal, Apurva Singh, Rishi Ranjan Univ Lethbridge Dept Math & Comp Sci 4401 Univ Dr Lethbridge AB Canada Indian Inst Technol Ropar Dept Comp Sci & Engn Nangal Rd Rupnagar 140001 Punjab India Indian Inst Technol Bhilai Dept Comp Sci & Engn GEC Campus Raipur 492015 Chhattisgarh India
In this paper, we give randomized approximation algorithms for stochastic cumulative VRPs for the split and unsplit deliveries. The approximation ratios are max{1 + 1.5 alpha, 3} and 6, respectively, where a is the ap... 详细信息
来源: 评论
A matter of degree:: Improved approximation algorithms for degree-bounded minimum spanning trees
收藏 引用
SIAM JOURNAL ON COMPUTING 2002年 第6期31卷 1783-1793页
作者: Könemann, J Ravi, R Carnegie Mellon Univ Grad Sch Ind Adm Pittsburgh PA 15213 USA
In this paper, we present a new bicriteria approximation algorithm for the degree-bounded minimum spanning tree problem. I this problem, we are given an undirected graph, a nonnegative cost function on the edges, and ... 详细信息
来源: 评论
Comparisons of four approximation algorithms for large-scale linkage map construction
收藏 引用
THEORETICAL AND APPLIED GENETICS 2011年 第4期123卷 649-655页
作者: Wu, Jixiang Jenkins, Johnie N. McCarty, Jack C. Lou, Xiang-Yang S Dakota State Univ Dept Plant Sci Brookings SD 57007 USA Mississippi State Univ Dept Plant Sci Mississippi State MS 39762 USA USDA ARS Crop Sci Res Lab Mississippi State MS 39762 USA Univ Alabama Dept Biostat Birmingham AL 35294 USA
Efficient construction of large-scale linkage maps is highly desired in current gene mapping projects. To evaluate the performance of available approaches in the literature, four published methods, the insertion (IN),... 详细信息
来源: 评论
Faster approximation algorithms for maximizing a monotone submodular function subject to a b-matching constraint
收藏 引用
INFORMATION PROCESSING LETTERS 2016年 第9期116卷 578-584页
作者: Fujii, Kaito Kyoto Univ Grad Sch Informat Sakyo Ku 36-1 Yoshida Honmachi Kyoto 6068501 Japan
Maximizing a monotone submodular function subject to a b-matching constraint is increasing in importance due to its application to the content spread maximization problem, but few practical algorithms are known other ... 详细信息
来源: 评论
Improved approximation algorithms for the uncapacitated facility location problem
收藏 引用
SIAM JOURNAL ON COMPUTING 2003年 第1期33卷 1-25页
作者: Chudak, FA Shmoys, DB Cornell Univ Sch Operat Res & Ind Engn Ithaca NY 14853 USA Swiss Fed Inst Technol Swiss Fed Inst Technol Inst Operat Res Zurich Switzerland Cornell Univ Dept Comp Sci Ithaca NY 14853 USA
We consider the uncapacitated facility location problem. In this problem, there is a set of locations at which facilities can be built;a fixed cost f(i) is incurred if a facility is opened at location i. Furthermore, ... 详细信息
来源: 评论
Improved approximation algorithms for Projection Games
收藏 引用
ALGORITHMICA 2017年 第2期77卷 555-594页
作者: Manurangsi, Pasin Moshkovitz, Dana Univ Calif Berkeley Berkeley CA 94720 USA MIT 77 Massachusetts Ave Cambridge MA 02139 USA
The projection games (aka Label Cover) problem is of great importance to the field of approximation algorithms, since most of the NP-hardness of approximation results we know today are reductions from Label Cover. In ... 详细信息
来源: 评论
On greedy approximation algorithms for a class of two-stage stochastic assignment problems
收藏 引用
OPTIMIZATION METHODS & SOFTWARE 2014年 第1期29卷 42-67页
作者: Karademir, Serdar Kong, Nan Prokopyev, Oleg A. Univ Pittsburgh Dept Ind Engn Pittsburgh PA 15260 USA Purdue Univ Weldon Sch Biomed Engn W Lafayette IN 47907 USA
In this paper we consider the two-stage stochastic linear assignment (2SSLA) problem, which is a stochastic extension of the classical deterministic linear assignment problem. For each agent and job, the decision make... 详细信息
来源: 评论