咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 32,005 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 16,009 篇 工学
    • 10,099 篇 计算机科学与技术...
    • 4,880 篇 电气工程
    • 3,123 篇 软件工程
    • 2,683 篇 信息与通信工程
    • 1,951 篇 控制科学与工程
    • 738 篇 机械工程
    • 680 篇 电子科学与技术(可...
    • 605 篇 航空宇航科学与技...
    • 532 篇 仪器科学与技术
    • 229 篇 交通运输工程
    • 212 篇 材料科学与工程(可...
    • 195 篇 化学工程与技术
    • 171 篇 生物工程
    • 153 篇 测绘科学与技术
    • 135 篇 土木工程
    • 134 篇 生物医学工程(可授...
    • 133 篇 动力工程及工程热...
  • 10,438 篇 理学
    • 9,373 篇 数学
    • 874 篇 物理学
    • 766 篇 系统科学
    • 738 篇 统计学(可授理学、...
    • 265 篇 生物学
    • 235 篇 化学
    • 126 篇 地球物理学
  • 2,489 篇 管理学
    • 1,926 篇 管理科学与工程(可...
    • 673 篇 工商管理
    • 557 篇 图书情报与档案管...
  • 418 篇 经济学
    • 387 篇 应用经济学
  • 211 篇 医学
    • 175 篇 临床医学
  • 180 篇 法学
    • 167 篇 社会学
  • 128 篇 文学
  • 128 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 32,005 篇 approximation al...
  • 2,737 篇 algorithm design...
  • 2,342 篇 optimization
  • 2,306 篇 approximation me...
  • 2,165 篇 heuristic algori...
  • 1,423 篇 linear programmi...
  • 1,409 篇 convergence
  • 1,277 篇 computational mo...
  • 1,216 篇 resource managem...
  • 1,140 篇 signal processin...
  • 957 篇 computer science
  • 914 篇 polynomials
  • 908 篇 clustering algor...
  • 906 篇 complexity theor...
  • 789 篇 mathematical mod...
  • 745 篇 vectors
  • 712 篇 programming
  • 648 篇 estimation
  • 614 篇 transportation
  • 612 篇 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 篇 hong kong polyte...
  • 28 篇 tel aviv univers...

作者

  • 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,281 篇 英文
  • 575 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
32005 条 记 录,以下是611-620 订阅
排序:
Limits of Greedy approximation algorithms for the Maximum Planar Subgraph Problem  27th
Limits of Greedy Approximation Algorithms for the Maximum Pl...
收藏 引用
27th International Workshop on Combinatorial algorithms (IWOCA)
作者: Chimani, Markus Hedtke, Ivo Wiedera, Tilo Univ Osnabruck Theoret Comp Sci Osnabruck Germany
The Maximum Planar Subgraph (MPS) problem asks for a planar subgraph with maximum edge cardinality of a given undirected graph. It is known to be MaxSNP-hard and the currently best known approximation algorithm achiev... 详细信息
来源: 评论
Fast approximation algorithms for p-centers in Large δ-hyperbolic Graphs  1
收藏 引用
13th International Workshop on algorithms and Models for the Web Graph (WAW)
作者: Edwards, Katherine Kennedy, Sean Saniee, Iraj Princeton Univ Dept Comp Sci Princeton NJ 08540 USA Bell Labs Math Networks & Commun Dept Holmdel NJ 07974 USA
We provide a quasilinear time algorithm for the p-center problem with an additive error less than or equal to 3 times the input graph's hyperbolic constant. Specifically, for the graph G = (V, E) with n vertices, ... 详细信息
来源: 评论
On approximation algorithms for Concave Mixed-Integer Quadratic Programming  1
收藏 引用
18th International Conference on Integer Programming and Combinatorial Optimization (IPCO)
作者: Del Pia, Alberto Univ Wisconsin Inst Discovery Dept Ind & Syst Engn & Wisconsin Madison WI USA
We describe an algorithm that finds an is an element of-approximate solution to a concave mixed-integer quadratic programming problem. The running time of the proposed algorithm is polynomial in the size of the proble... 详细信息
来源: 评论
Better approximation algorithms for Scaffolding Problems  1
收藏 引用
10th International Frontiers of Algorithmics Workshop (FAW)
作者: Chen, Zhi-Zhong Harada, Youta Machida, Eita Guo, Fei Wang, Lusheng Tokyo Denki Univ Div Informat Syst Design Saitama Hatoyama 3500394 Japan Tianjin Univ Sch Comp Sci & Technol Tianjin Peoples R China City Univ Hong Kong Dept Comp Sci Tat Chee Ave Kowloon Hong Kong Peoples R China
Scaffolding is one of the main stages in genome assembly. During this stage, we want to merge contigs assembled from the paired-end reads into bigger chains called scaffolds. For this purpose, the following graph-theo... 详细信息
来源: 评论
approximation and Online algorithms for NFV-Enabled Multicasting in SDNs  37
Approximation and Online Algorithms for NFV-Enabled Multicas...
收藏 引用
37th IEEE International Conference on Distributed Computing Systems (ICDCS)
作者: Xu, Zichuan Liang, Weifa Huang, Meitian Jia, Mike Guo, Song Galis, Alex Australian Natl Univ Canberra ACT 0200 Australia UCL London WC1E 7JE England Hong Kong Polytech Univ Hong Kong Hong Kong Peoples R China
Multicasting is a fundamental functionality of networks for many applications including online conferencing, event monitoring, video streaming, and system monitoring in data centers. To ensure multicasting reliable, s... 详细信息
来源: 评论
Scheduling distributed clusters of parallel machines: Primal-dual and LP-based approximation algorithms  24
Scheduling distributed clusters of parallel machines: Primal...
收藏 引用
24th Annual European Symposium on algorithms, ESA 2016
作者: Murray, Riley Chao, Megan Khuller, Samir Department of Industrial Engineering and Operations Research University of California Berkeley United States Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge United States Department of Computer Science University of Maryland College Park United States
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... 详细信息
来源: 评论
Fast approximation algorithms for the generalized survivable network design problem  27
Fast approximation algorithms for the generalized survivable...
收藏 引用
27th International Symposium on algorithms and Computation, ISAAC 2016
作者: Feldmann, Andreas Emil Könemann, Jochen Pashkovich, Kanstantsin Sanità, Laura Charles University Prague Czech Republic Dept. of Combinatorics and Optimization University of Waterloo Canada
In a standard f-connectivity network design problem, we are given an undirected graph G = (V, E), a cut-requirement function f : 2V → N, and non-negative costs c(e) for all e ∈ E. We are then asked to find a minimum... 详细信息
来源: 评论
Exact and approximation algorithms for weighted matroid intersection  27
Exact and approximation algorithms for weighted matroid inte...
收藏 引用
27th Annual ACM-SIAM Symposium on Discrete algorithms, SODA 2016
作者: Huang, Chien-Chung Kakimura, Naonori Kamiyama, Naoyuki Department ot Computer Science and Engineering Chalmers University of Technology Sweden Graduate School of Arts and Sciences University of Tokyo Japan Institute of Mathematics for Industry Kyushu University Japan
In this paper, we propose new exact and approximation algorithms for the weighted matroid intersection problem. Our exact algorithm is faster than previous algorithms when the largest weight is relatively small. Our a... 详细信息
来源: 评论
approximation algorithms for Fragmenting a Graph Against a Stochastically-Located Threat
收藏 引用
THEORY OF COMPUTING SYSTEMS 2015年 第1期56卷 96-134页
作者: Shmoys, David B. Spencer, Gwen Cornell Univ Sch ORIE Ithaca NY 14853 USA Cornell Univ Dept Comp Sci Ithaca NY 14853 USA Dartmouth Coll Neukom Inst Hanover NH 03755 USA
Motivated by issues in allocating limited preventative resources to protect a landscape against the spread of a wildfire from a stochastic ignition point, we give approximation algorithms for a new family of stochasti... 详细信息
来源: 评论
Improved approximation algorithms for k-submodular function maximization  27
Improved approximation algorithms for k-submodular function ...
收藏 引用
27th Annual ACM-SIAM Symposium on Discrete algorithms, SODA 2016
作者: Iwata, Satoru Tanigawa, Shin-Ichi Yoshida, Yuichi Department of Mathematical Informatics University of Tokyo Japan Research Institute for Mathematical Sciences Kyoto University Centrum Wiskunde and Informatica Japan National Institute of Informatics and Preferred Infrastructure Inc. Japan
This paper presents a polynomial-time 1/2-approximation algorithm for maximizing nonnegative k-submodular functions. This improves upon the previous max{l/3,1/(1+ a)}-approximation by Ward and Živný [18], where a... 详细信息
来源: 评论