咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是631-640 订阅
排序:
New approximation algorithms for routing with multiport terminals
收藏 引用
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2000年 第10期19卷 1118-1128页
作者: Helvig, CS Robins, G Zelikovsky, A Univ Virginia Dept Comp Sci Charlottesville VA 22903 USA Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA
Previous literature on very large scale integration routing and wiring estimation typically assumes a one-to-one correspondence between terminals and ports. In practice, however, each "terminal" consists of ... 详细信息
来源: 评论
A NOTE ON DUAL approximation algorithms FOR CLASS CONSTRAINED BIN PACKING PROBLEMS
收藏 引用
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS 2009年 第2期43卷 239-248页
作者: Xavier, Eduardo C. Miyazawa, Flavio Keidi Univ Estadual Campinas UNICAMP Inst Comp BR-13083970 Campinas SP Brazil
In this paper we present a dual approximation scheme for the class constrained shelf bin packing problem. In this problem, we are given bins of capacity 1, and n items of Q different classes, each item e with class c(... 详细信息
来源: 评论
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
收藏 引用
SIAM JOURNAL ON COMPUTING 2002年 第5期31卷 1608-1623页
作者: Halperin, E Tel Aviv Univ Dept Comp Sci IL-69978 Tel Aviv Israel
We obtain improved algorithms for finding small vertex covers in bounded degree graphs and hypergraphs. We use semidefinite programming to relax the problems and introduce new rounding techniques for these relaxations... 详细信息
来源: 评论
Efficient approximation algorithms for Scheduling Coflows With Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time
收藏 引用
IEEE TRANSACTIONS ON SERVICES COMPUTING 2024年 第5期17卷 2349-2364页
作者: Chen, Chi-Yeh Natl Cheng Kung Univ Dept Comp Sci & Informat Engn Tainan 701 Taiwan
This article focuses on the problem of coflow scheduling with precedence constraints in identical parallel networks, a well-known NP -hard problem. Coflow is a relatively new network abstraction that characterizes com... 详细信息
来源: 评论
New approximation algorithms for the Unsplittable Capacitated Facility Location Problem
收藏 引用
ALGORITHMICA 2016年 第1期75卷 53-83页
作者: Behsaz, Babak Salavatipour, Mohammad R. Svitkina, Zoya Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada Google Inc 1600 Amphitheatre Pkwy Mountain View CA 94043 USA
In this paper, we consider the Unsplittable (hard) Capacitated Facility Location Problem (UCFLP) with uniform capacities and present new approximation algorithms for it. This problem is a generalization of the classic... 详细信息
来源: 评论
Practical approximation algorithms for zero- and bounded-skew trees
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2002年 第1期15卷 97-111页
作者: Zelikovsky, AZ Mandoiu, II Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA Univ Calif San Diego Dept Comp Sci & Engn La Jolla CA 92093 USA
The skew of an edge-weighted rooted tree is the maximum difference between any two root-to-leaf path weights. Zero- or bounded-skew trees are needed for achieving synchronization in many applications, including networ... 详细信息
来源: 评论
Improved approximation algorithms for metric MaxTSP
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2007年 第4期13卷 321-336页
作者: Chen, Zhi-Zhong Nagoya, Takayuki Tokyo Denki Univ Dept Math Sci Hatoyama Saitama 3500394 Japan
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation ratio is 27/35. The other is for undirect... 详细信息
来源: 评论
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2003年 第3期67卷 473-496页
作者: Guruswami, V Khanna, S Rajaraman, R Shepherd, B Yannakakis, M Univ Penn Dept Comp & Informat Sci Philadelphia PA 19104 USA MIT Comp Sci Lab Cambridge MA 02139 USA Northeastern Univ Coll Comp Sci Boston MA 02115 USA Bell Labs Murray Hill NJ 07974 USA
We study the approximability of edge-disjoint paths and related problems. In the edge-disjoint paths (EDP) problem, we are given a network G with source-sink pairs (s(i), t(i)), 1 less than or equal to i less than or ... 详细信息
来源: 评论
The ordered k-median problem: surrogate models and approximation algorithms
收藏 引用
MATHEMATICAL PROGRAMMING 2019年 第1-2期177卷 55-83页
作者: Aouad, Ali Segev, Danny London Business Sch London NW1 4SA England Univ Haifa Dept Stat IL-31905 Haifa Israel
In the last two decades, a steady stream of research has been devoted to studying various computational aspects of the ordered k-median problem, which subsumes traditional facility location problems (such as median, c... 详细信息
来源: 评论
Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based approximation algorithms
收藏 引用
ALGORITHMICA 2018年 第10期80卷 2777-2798页
作者: Murray, Riley Khuller, Samir Chao, Megan Univ Calif Berkeley Dept Ind Engn & Operat Res Berkeley CA 94709 USA Univ Maryland Dept Comp Sci College Pk MD 20742 USA MIT Dept Elect Engn & Comp Sci 50 Vassar St Cambridge MA 02142 USA
The Map-Reduce computing framework rose to prominence with datasets of such size that dozens of machines on a single cluster were needed for individual jobs. As datasets approach the exabyte scale, a single job may ne... 详细信息
来源: 评论