咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是481-490 订阅
排序:
Approximate Positive Correlated Distributions and approximation algorithms for D-optimal Design  29
Approximate Positive Correlated Distributions and Approximat...
收藏 引用
29th Annual ACM-SIAM Symposium on Discrete algorithms (SODA)
作者: Singh, Mohit Xie, Weijun Georgia Inst Technol Sch Ind & Syst Engn Atlanta GA 30332 USA Virginia Tech Dept Ind & Syst Engn Blacksburg VA 24060 USA
Experimental design is a classical area in statistics [21] and has also found new applications in machine learning[2]. In the combinatorial experimental design problem, the aim is to estimate an unknown m-dimensional ... 详细信息
来源: 评论
Constant-factor approximation algorithms for parity-constrained facility location problems
arXiv
收藏 引用
arXiv 2019年
作者: Kim, Kangsan Shin, Yongho An, Hyung-Chan Department of Computer Science Yonsei University Korea Republic of
Facility location is a prominent optimization problem that has inspired a large quantity of both theoretical and practical studies in combinatorial optimization. Although the problem has been investigated under variou... 详细信息
来源: 评论
Improved approximation algorithms for Inventory Problems∗
arXiv
收藏 引用
arXiv 2019年
作者: Bosman, Thomas Olver, Neil *** Amsterdam Netherlands Department of Mathematics London School of Economics and Political Science London United Kingdom
We give new approximation algorithms for the submodular joint replenishment problem and the inventory routing problem, using an iterative rounding approach. In both problems, we are given a set of N items and a discre... 详细信息
来源: 评论
Tight approximation algorithms for bichromatic graph diameter and related problems
arXiv
收藏 引用
arXiv 2019年
作者: Dalirrooyfard, Mina VassilevskaWilliams, Virginia Vyas, Nikhil Wein, Nicole MIT
Some of the most fundamental and well-studied graph parameters are the Diameter (the largest shortest paths distance) and Radius (the smallest distance for which a "center" node can reach all other nodes). T... 详细信息
来源: 评论
Distributed approximation algorithms for Steiner Tree in the CONGESTED CLIQUE model
arXiv
收藏 引用
arXiv 2019年
作者: Saikia, Parikshit Karmakar, Sushanta Department of Computer Science and Engineering Indian Institute of Technology Guwahati781039 India
The Steiner tree problem is one of the fundamental and classical problems in combinatorial optimization. In this paper we study this problem in the CONGEST ED CLIQUE model of distributed computing and present two dete... 详细信息
来源: 评论
Distributed Local approximation algorithms for Maximum Matching in Graphs and Hypergraphs
Distributed Local Approximation Algorithms for Maximum Match...
收藏 引用
Annual IEEE Symposium on Foundations of Computer Science
作者: David G. Harris Department of Computer Science University of Maryland College Park USA
We describe approximation algorithms in Linial's classic LOCAL model of distributed computing to find maximum-weight matchings in a hypergraph of rank r. Our main result is a deterministic algorithm to generate a ... 详细信息
来源: 评论
Efficient approximation algorithms for Adaptive Seed Minimization
arXiv
收藏 引用
arXiv 2019年
作者: Tang, Jing Huang, Keke Xiao, Xiaokui Lakshmanan, Laks V.S. Tang, Xueyan Sun, Aixin Lim, Andrew Dept. of Ind. Syst. Engg. and Mgmt. National University of Singapore School of Comp. Sci. and Engg Nanyang Technological University School of Computing National University of Singapore Department of Computer Science University of British Columbia School of Computer Science and Engineering Nanyang Technological University
As a dual problem of influence maximization, the seed minimization problem asks for the minimum number of seed nodes to influence a required number η of users in a given social network G. Existing algorithms for seed... 详细信息
来源: 评论
Contiguous cake cutting: Hardness results and approximation algorithms
arXiv
收藏 引用
arXiv 2019年
作者: Goldberg, Paul W. Hollender, Alexandros Suksompong, Warut Department of Computer Science University of Oxford
We study the fair allocation of a cake, which serves as a metaphor for a divisible resource, under the requirement that each agent should receive a contiguous piece of the cake. While it is known that no finite envy-f... 详细信息
来源: 评论
Efficient approximation algorithms for adaptive target profit maximization
arXiv
收藏 引用
arXiv 2019年
作者: Huang, Keke Tang, Jing Xiao, Xiaokui Sun, Aixin Lim, Andrew School of Comp. Sci. and Engg Nanyang Technological University Dept. of Ind.Syst. Engg. Mgmt. National University of Singapore School of Computing National University of Singapore
Given a social network G, the profit maximization (PM) problem asks for a set of seed nodes to maximize the profit, i.e., revenue of influence spread less the cost of seed selection. The target profit maximization (TP... 详细信息
来源: 评论
Improved approximation algorithms for Minimum Power Covering Problems  16th
Improved Approximation Algorithms for Minimum Power Covering...
收藏 引用
16th International Workshop on approximation and Online algorithms (WAOA)
作者: Calinescu, Gruia Kortsarz, Guy Nutov, Zeev IIT Chicago IL 60616 USA Rutgers State Univ Camden NJ USA Open Univ Israel Raanana Israel
Given an undirected graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless netwo... 详细信息
来源: 评论