咨询与建议

限定检索结果

文献类型

  • 22,830 篇 会议
  • 9,106 篇 期刊文献
  • 62 篇 学位论文
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

  • 31,999 篇 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,275 篇 英文
  • 575 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
31999 条 记 录,以下是561-570 订阅
排序:
The k-hop connected dominating set problem: approximation algorithms and hardness results
The k-hop connected dominating set problem: approximation al...
收藏 引用
作者: Rafael Santos Coelho Universidade de Sao Paulo
学位级别:博士
Let G be a connected graph and k be a positive integer. A vertex subset D of G is a k-hop connected dominating set if the subgraph of G induced by D is connected, and for every vertex v in G, there is a vertex u in D ... 详细信息
来源: 评论
A family of approximation algorithms for the maximum duo-preservation string mapping problem  28
A family of approximation algorithms for the maximum duo-pre...
收藏 引用
28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017
作者: Dudek, Bartlomiej Gawrychowski, Pawel Ostropolski-Nalewaja, Piotr Institute of Computer Science University of Wroclaw Wroclaw Poland University of Haifa Haifa Israel
In the Maximum Duo-Preservation String Mapping problem we are given two strings and wish to map the letters of the former to the letters of the latter as to maximise the number of duos. A duo is a pair of consecutive ... 详细信息
来源: 评论
Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs Regular Submission  18
Distributed approximation algorithms for k-dominating set in...
收藏 引用
Joint 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic, ICTCS 2017 and CILC 2017
作者: Czygrinow, Andrzej Hańckowiak, Michal Wawrzyniak, Wojciech Witkowski, Marcin Faculty of Mathematics and Computer Science Adam Mickiewicz University Poznan Poland School of Mathematical and Statistical Sciences Arizona State University TempeAZ85287-1804 United States
A k-dominating set in a graph G = (V,E) is a set U ¢ V such that ever vertex of G is either in U or has at least k neighbors in U. In this paper we give simple distributed approximation algorithms in the local mo... 详细信息
来源: 评论
approximation algorithms for Stochastic Combinatorial Optimization Problems
收藏 引用
Journal of the Operations Research Society of China 2016年 第1期4卷 1-47页
作者: Jian Li Yu Liu Institute for Interdisciplinary Information Sciences Tsinghua UniversityBeijing 100084China
Stochastic optimization has established itself as a major method to handle uncertainty in various optimization problems by modeling the uncertainty by a probability distribution over possible ***,the main focus in st... 详细信息
来源: 评论
approximation algorithms for TSP with neighborhoods in the plane
arXiv
收藏 引用
arXiv 2017年
作者: Dumitrescu, Adrian Mitchell, Joseph S.B. University of Wisconsin-Milwaukee MilwaukeeWI53201-0784 United States Stony Brook University Stony BrookNY11794-3600 United States
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of the classical Euclidean TSP, TSPN is a... 详细信息
来源: 评论
Coordination mechanisms, cost-sharing, and approximation algorithms for scheduling  1
收藏 引用
13th International Conference on Web and Internet Economics, WINE 2017
作者: Caragiannis, Ioannis Gkatzelis, Vasilis Vinci, Cosimo University of Patras Rion-Patras Greece Drexel University PhiladelphiaPA United States Gran Sasso Science Institute L’Aquila Italy
We reveal a connection between coordination mechanisms for unrelated machine scheduling and cost-sharing protocols. Using this connection, we interpret three coordination mechanisms from the recent literature as Shapl... 详细信息
来源: 评论
approximation algorithms for Label Cover and The Log-Density Threshold  17
Approximation Algorithms for Label Cover and The Log-Density...
收藏 引用
Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms
作者: Eden Chlamtac Pasin Manurangsi Dana Moshkovitz Aravindan Vijayaraghavan Department of Computer Science Ben-Gurion University Department of Electrical Engineering and Computer Science UC Berkeley Department of Computer Science UT Austin Department of Electrical Engineering and Computer Science Northwestern University
Many known optimal NP-hardness of approximation results are reductions from a problem called LABEL-COVER. The input is a bipartite graph G = (L, R, E) and each edge e = (x, y) ∈ E carries a projection π_e that maps ... 详细信息
来源: 评论
approximation algorithms for 0-low rank approximation
arXiv
收藏 引用
arXiv 2017年
作者: Bringmann, Karl Kolev, Pavel Woodruff, David P. Max Planck Institute for Informatics Saarland Informatics Campus Saarbrucken Germany Department of Computer Science Carnegie Mellon University
We study the 0-Low Rank approximation Problem, where the goal is, given an m×n matrix A, to output a rank-k matrix A for which kA-Ak0 is minimized. Here, for a matrix B, kBk0 denotes the number of its non-zero en... 详细信息
来源: 评论
approximation algorithms for Finding Maximum Induced Expanders  17
Approximation Algorithms for Finding Maximum Induced Expande...
收藏 引用
Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms
作者: Shayan Oveis Gharan Alireza Rezaei Department of Computer Science and Engineering University of Washington
We initiate the study of approximating the largest induced expander in a given graph G. Given a Δ-regular graph G with n vertices, the goal is to find the set with the largest induced expansion of size at least δ... 详细信息
来源: 评论
Exact and approximation algorithms for the scheduling tasks to minimize the number of processors  8
Exact and approximation algorithms for the scheduling tasks ...
收藏 引用
8th International Conference on Optimization and Applications, OPTIMA 2017
作者: Grigoreva, Natalia S. St.Petersburg State University Universitetskaj nab. 7/9 St.Petersburg199034 Russia
The multiprocessor scheduling problem is one of the classic NP-hard optimization problems. The goal of this paper is to prepare algorithms for scheduling problem where set of tasks is performed on parallel identical p... 详细信息
来源: 评论