咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 15,920 篇 工学
    • 10,031 篇 计算机科学与技术...
    • 4,844 篇 电气工程
    • 3,064 篇 软件工程
    • 2,672 篇 信息与通信工程
    • 1,947 篇 控制科学与工程
    • 738 篇 机械工程
    • 679 篇 电子科学与技术(可...
    • 605 篇 航空宇航科学与技...
    • 532 篇 仪器科学与技术
    • 230 篇 交通运输工程
    • 215 篇 材料科学与工程(可...
    • 195 篇 化学工程与技术
    • 171 篇 生物工程
    • 144 篇 测绘科学与技术
    • 134 篇 动力工程及工程热...
    • 134 篇 生物医学工程(可授...
    • 130 篇 土木工程
  • 10,398 篇 理学
    • 9,341 篇 数学
    • 869 篇 物理学
    • 766 篇 系统科学
    • 737 篇 统计学(可授理学、...
    • 264 篇 生物学
    • 236 篇 化学
  • 2,477 篇 管理学
    • 1,925 篇 管理科学与工程(可...
    • 671 篇 工商管理
    • 547 篇 图书情报与档案管...
  • 417 篇 经济学
    • 386 篇 应用经济学
  • 206 篇 医学
    • 171 篇 临床医学
  • 179 篇 法学
    • 166 篇 社会学
  • 128 篇 文学
    • 123 篇 新闻传播学
  • 128 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 31,877 篇 approximation al...
  • 2,736 篇 algorithm design...
  • 2,322 篇 optimization
  • 2,304 篇 approximation me...
  • 2,148 篇 heuristic algori...
  • 1,422 篇 linear programmi...
  • 1,400 篇 convergence
  • 1,268 篇 computational mo...
  • 1,213 篇 resource managem...
  • 1,132 篇 signal processin...
  • 956 篇 computer science
  • 910 篇 polynomials
  • 904 篇 clustering algor...
  • 902 篇 complexity theor...
  • 791 篇 mathematical mod...
  • 731 篇 vectors
  • 712 篇 programming
  • 646 篇 estimation
  • 611 篇 transportation
  • 607 篇 training

机构

  • 97 篇 univ maryland de...
  • 70 篇 technion israel ...
  • 55 篇 univ waterloo de...
  • 49 篇 cornell univ dep...
  • 42 篇 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 篇 tel aviv univers...
  • 28 篇 max planck inst ...
  • 27 篇 epfl

作者

  • 64 篇 woodruff david p...
  • 64 篇 ravi r.
  • 52 篇 kortsarz guy
  • 43 篇 lee euiwoong
  • 43 篇 levin asaf
  • 41 篇 chan timothy m.
  • 41 篇 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,192 篇 英文
  • 548 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 5 篇 法文
  • 3 篇 德文
  • 2 篇 西班牙文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
31877 条 记 录,以下是191-200 订阅
排序:
approximation algorithms for the transportation problem with market choice and related models
收藏 引用
OPERATIONS RESEARCH LETTERS 2014年 第8期42卷 549-552页
作者: Aardal, Karen Le Bodic, Pierre Delft Univ Technol Delft Inst Appl Math Delft Netherlands Ctr Wiskunde & Informat Amsterdam Netherlands Georgia Inst Technol H Milton Stewart Sch Ind & Syst Engn Atlanta GA 30332 USA
Given facilities with capacities and clients with penalties and demands, the transportation problem with market choice consists in finding the minimum-cost way to partition the clients into unserved clients, paying th... 详细信息
来源: 评论
approximation algorithms for the Fault-Tolerant Facility Placement problem
收藏 引用
INFORMATION PROCESSING LETTERS 2011年 第11期111卷 545-549页
作者: Yan, Li Chrobak, Marek Univ Calif Riverside Dept Comp Sci Riverside CA 92521 USA
In the Fault-Tolerant Facility Placement problem (FTFP) we are given a set of customers C, a set of sites F, and distances between customers and sites. We assume that the distances satisfy the triangle inequality. Eac... 详细信息
来源: 评论
approximation algorithms for color spanning diameter
收藏 引用
INFORMATION PROCESSING LETTERS 2018年 135卷 53-56页
作者: Kazemi, Mohammad Reza Mohades, Ali Khanteimouri, Payam Amirkabir Univ Technol Tehran Polytech Tehran Iran Alzahra Univ Fac Math Sci Dept Comp Sci Tehran Iran
Minimum Diameter Color Spanning Set (MDCSS) on a given set of colored points is the problem of selecting one point from each color such that the diameter of the selected points gets minimized. In this paper, we presen... 详细信息
来源: 评论
approximation algorithms for maximum dispersion
收藏 引用
OPERATIONS RESEARCH LETTERS 1997年 第3期21卷 133-137页
作者: Hassin, R Rubinstein, S Tamir, A Department of Statistics and Operations Research School of Mathematical Sciences Tel-Aviv University Ramat Aviv Tel-Aviv 69978 Israel
We describe approximation algorithms with bounded performance guarantees for the following problem: A graph is given with edge weights satisfying the triangle inequality, together with two numbers k and p. Find k disj... 详细信息
来源: 评论
approximation algorithms for Two-State Anti-Ferromagnetic Spin Systems on Bounded Degree Graphs
收藏 引用
JOURNAL OF STATISTICAL PHYSICS 2014年 第4期155卷 666-686页
作者: Sinclair, Alistair Srivastava, Piyush Thurley, Marc Univ Calif Berkeley Berkeley CA 94720 USA Medallia Inc Buenos Aires DF Argentina
We show that for the anti-ferromagnetic Ising model on the Bethe lattice, weak spatial mixing implies strong spatial mixing. As a by-product of our analysis, we obtain what is to the best of our knowledge the first ri... 详细信息
来源: 评论
approximation algorithms FOR SCHEDULING ON UNIFORM PROCESSORS
收藏 引用
INFOR 1993年 第1期31卷 16-23页
作者: FRACCHIA, FD SAXTON, LV
The problem of scheduling independent tasks on uniform processors in order to minimize the maximum completion time of the schedule is strongly NP-complete. Therefore, the existence of a polynomial or even a pseudo-pol... 详细信息
来源: 评论
approximation algorithms for the arc orienteering problem
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第2期115卷 313-315页
作者: Gavalas, Damianos Konstantopoulos, Charalampos Mastakas, Konstantinos Pantziou, Grammati Vathis, Nikolaos Univ Aegean Dept Cultural Technol & Commun Mitilini Greece Univ Piraeus Dept Informat Karaoli Greece Natl Tech Univ Athens Sch Appl Math & Phys Sci GR-10682 Athens Greece Technol Educ Inst Athens Dept Informat Athens Greece Natl Tech Univ Athens Sch Elect & Comp Engn GR-10682 Athens Greece Comp Technol Inst & Press Diophantus Patras Greece
In this article we present approximation algorithms for the Arc Orienteering Problem (AOP). We propose a polylogarithmic approximation algorithm in directed graphs, while in undirected graphs we give a (6 + epsilon + ... 详细信息
来源: 评论
approximation algorithms for the class cover problem
收藏 引用
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2004年 第3-4期40卷 215-223页
作者: Cannon, AH Cowen, LJ Columbia Univ Dept Comp Sci New York NY 10027 USA Tufts Univ Dept Comp Sci Medford MA 02140 USA
We introduce the class cover problem, a variant of disk cover with forbidden regions, with applications to classification and facility location problems. We prove similar hardness results to disk cover. We then presen... 详细信息
来源: 评论
approximation algorithms for connected dominating sets
收藏 引用
ALGORITHMICA 1998年 第4期20卷 374-387页
作者: Guha, S Khuller, S Stanford Univ Dept Comp Sci Stanford CA 94305 USA Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland UMIACS College Pk MD 20742 USA
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex in the dominating set... 详细信息
来源: 评论
approximation algorithms for PSPACE-hard hierarchically and periodically specified problems
收藏 引用
SIAM JOURNAL ON COMPUTING 1998年 第5期27卷 1237-1261页
作者: Marathe, MV Hunt, HB Stearns, RE Radhakrishnan, V Los Alamos Natl Lab Los Alamos NM 87545 USA SUNY Albany Dept Comp Sci Albany NY 12222 USA Hewlett Packard Corp Cupertino CA 95014 USA
We study the efficient approximability of basic graph and logic problems in the literature when instances are specified hierarchically as in [T. Lengauer, J. Assoc. Comput. Mach., 36(1989), pp. 474-509] or are specifi... 详细信息
来源: 评论