咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是271-280 订阅
排序:
approximation algorithms for Piercing Special Families of Hippodromes: An Extended Abstract  18th
Approximation Algorithms for Piercing Special Families of Hi...
收藏 引用
18th International Conference on Mathematical Optimization Theory and Operations Research (MOTOR)
作者: Kobylkin, Konstantin Dryakhlova, Irina RAS Ural Branch Krasovsky Inst Math & Mech Sophya Kovalevskaya Str 16 Ekaterinburg 620108 Russia Ural Fed Univ Mira Str 19 Ekaterinburg 620002 Russia
Polynomial time approximation algorithms are proposed with constant approximation factors for a problem of computing the smallest cardinality set of identical disks whose union intersects each segment from a given set... 详细信息
来源: 评论
approximation algorithms for geometric intersection graphs
Approximation algorithms for geometric intersection graphs
收藏 引用
33rd International Workshop on Graph-Theoretic Concepts in Computer Science
作者: Jansen, Klaus Univ Kiel Inst Informat Olshaussenstr 40 D-24098 Kiel Germany
In this paper we describe together with an overview about other results the main ideas of our polynomial time approximation schemes for the maximum weight independent set problem (selecting a set of disjoint disks in ... 详细信息
来源: 评论
approximation algorithms for scheduling parallel jobs:: Breaking the approximation ratio of 2
收藏 引用
35th International Colloquium on Automata, Languages and Programming
作者: Jansen, Klaus Thoele, Ralf Univ Kiel Inst Informat D-24098 Kiel Germany
In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this problem we show that a schedule With length at... 详细信息
来源: 评论
approximation algorithms for the Capacitated Domination Problem
Approximation Algorithms for the Capacitated Domination Prob...
收藏 引用
4th International Frontiers of Algorithmics Workshop
作者: Kao, Mong-Jen Chen, Han-Lin Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei Taiwan
We consider the Capacitated Damnation problem, which models a service-requirement assignment scenario and is a generalization to the well-known Dominating Set problem. In this problem, given a graph with three paramet... 详细信息
来源: 评论
approximation algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
Approximation Algorithms and Hardness Results for Packing El...
收藏 引用
12th International Workshop on approximation algorithms for Combinatorial Optimization Problems/13th International Workshop on Randomization and Computation
作者: Aazami, Ashkan Cheriyan, Joseph Jampani, Krishnam Raju Univ Waterloo Dept Comb & Opt Waterloo ON N2L 3G1 Canada Univ Waterloo Dept Comp Sci Waterloo ON N2L 3G1 Canada
We study the problem of packing element-disjoint Steiner trees in graphs. We are given a graph and a designated subset of terminal nodes, and the goal is to find a maximum cardinality set of element-disjoint trees suc... 详细信息
来源: 评论
approximation algorithms for Steiner Tree Augmentation Problems  34
Approximation Algorithms for Steiner Tree Augmentation Probl...
收藏 引用
34th ACM-SIAM Annual Symposium on Discrete algorithms (SODA)
作者: Ravi, R. Zhang, Weizhong Zlatin, Michael Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA
In the Steiner Tree Augmentation Problem (STAP), we are given a graph G = (V, E), a set of terminals R subset of V, and a Steiner tree T spanning R. The edges L := E \ E(T) are called links and have non-negative costs... 详细信息
来源: 评论
approximation algorithms for the sex-equal stable marriage problem
收藏 引用
10th International Workshop on algorithms and Data Structures
作者: Iwama, Kazuo Miyazaki, Shuichi Yanagisawa, Hiroki Kyoto Univ Grad Sch Informat Sakyo Ku Yoshidahonmachi Kyoto 6068501 Japan Kyoto Univ Acad Ctr Comp & Media Studies Kyoto 6068501 Japan IBM Corp Toky Res Lab Kanagawa 2428502 Japan
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial time algorithm to find one. However, th... 详细信息
来源: 评论
approximation algorithms for scheduling problems with exact delays
Approximation algorithms for scheduling problems with exact ...
收藏 引用
4th International Workshop on approximation and Online algorithms
作者: Ageev, Alexander A. Kononov, Alexander V. Sobolev Inst Math Pr Koptyuga 4 Novosibirsk Russia
We give first constant-factor approximations for various cases of the coupled-task single machine and two-machine flow shop scheduling problems with exact delays and makespan as the objective function. In particular, ... 详细信息
来源: 评论
approximation algorithms for Stochastic Minimum-Norm Combinatorial Optimization  61
Approximation Algorithms for Stochastic Minimum-Norm Combina...
收藏 引用
61st IEEE Annual Symposium on Foundations of Computer Science (FOCS)
作者: Ibrahimpur, Sharat Swamy, Chaitanya Univ Waterloo Dept Combinator & Optimizat Waterloo ON Canada
Motivated by the need for, and growing interest in, modeling uncertainty in data, we introduce and study stochastic minimum-norm optimization. We have an underlying combinatorial optimization problem where the costs i... 详细信息
来源: 评论
approximation algorithms for Scheduling with a Variable Machine Maintenance
Approximation Algorithms for Scheduling with a Variable Mach...
收藏 引用
6th International Conference on Algorithmic Aspects in Information and Management
作者: Luo, Wenchang Chen, Lin Zhang, Guochuan Zhejiang Univ Dept Math Hangzhou 310027 Zhejiang Peoples R China Ningbo Univ Fac Sci Ningbo 315211 Zhejiang Peoples R China Zhejiang Univ Coll Comp Sci Hangzhou 310027 Peoples R China
In this paper, we investigate the problem of scheduling weighted jobs on a single machine with a maintenance whose starting time is prior to a given deadline and whose duration is a nondecreasing function of the start... 详细信息
来源: 评论