咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是451-460 订阅
排序:
approximation algorithms for Network Design in Non-Uniform Fault Models  50
Approximation Algorithms for Network Design in Non-Uniform F...
收藏 引用
50th International Colloquium on Automata, Languages, and Programming, ICALP 2023
作者: Chekuri, Chandra Jain, Rhea Department of Computer Science University of Illinois Urbana-Champaign UrbanaIL United States
Classical network design models, such as the Survivable Network Design problem (SNDP), are (partly) motivated by robustness to faults under the assumption that any subset of edges upto a specific number can fail. We c... 详细信息
来源: 评论
approximation algorithms for QMA-complete problems
Approximation algorithms for QMA-complete problems
收藏 引用
作者: Gharibian, Sevag Kempe, Julia David R. Cheriton School of Computer Science Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Canada Blavatnik School of Computer Science Tel Aviv University Tel Aviv 69978 Israel CNRS and LIAFA Université Paris 7 Paris France
approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hami... 详细信息
来源: 评论
approximation algorithms for clustering problems with lower bounds and outliers  43
Approximation algorithms for clustering problems with lower ...
收藏 引用
43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016
作者: Ahmadian, Sara Swamy, Chaitanya Combinatorics and Optimization Univ. Waterloo WaterlooON Canada
We consider clustering problems with non-uniform lower bounds and outliers, and obtain the first approximation guarantees for these problems. We have a set F of facilities with lower bounds {Li}i∈F and a set D of cli... 详细信息
来源: 评论
approximation algorithms for Graph Cluster Editing Problems with Cluster Size at Most 3 and 4  22nd
Approximation Algorithms for Graph Cluster Editing Problems...
收藏 引用
22nd International Conference on Mathematical Optimization Theory and Operations Research , MOTOR 2023
作者: Il’ev, Victor Il’eva, Svetlana Dostoevsky Omsk State University Omsk Russia Sobolev Institute of Mathematics SB RAS Omsk Russia
In clustering problems, one has to partition a given set of objects into pairwise disjoint subsets (clusters) taking into account only similarity of objects. In the graph cluster editing problem similarity relation on... 详细信息
来源: 评论
approximation algorithms for Maximally Balanced Connected Graph Partition  1
收藏 引用
13th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2019
作者: Chen, Yong Chen, Zhi-Zhong Lin, Guohui Xu, Yao Zhang, An Department of Mathematics Hangzhou Dianzi University Hangzhou China Division of Information System Design Tokyo Denki University Saitama Japan Department of Computing Science University of Alberta Edmonton Canada Department of Computer Science Kettering University FlintMI United States
Given a simple connected graph, we seek to partition the vertex set V into k non-empty parts such that the subgraph induced by each part is connected, and the partition is maximally balanced in the way that the maximu... 详细信息
来源: 评论
approximation algorithms for string folding problems
收藏 引用
1st IFIP International Conference on Theoretical Computer Science, TCS 2000
作者: Mauri, Giancarlo Pavesi, Giulio Dept. of Computer Science Systems and Communication University of Milan Bicocca Milan Italy
We present polynomial{time approximation algorithms for string folding problems over any finite alphabet. Our idea is the following: describe a class of feasible solutions by means of an ambiguous contextfree grammar ... 详细信息
来源: 评论
approximation algorithms for clustering to minimize the sum of diameters  7th
收藏 引用
7th Scandinavian Workshop on Algorithm Theory, SWAT 2000
作者: Doddi, Srinivas R. Marathe, Madhav V. Ravi, S.S. Taylor, David Scot Widmayer, Peter Los Alamos National Laboratory P. O. Box 1663 MS B265 Los AlamosNM87545 United States Los Alamos National Laboratory P. O. Box 1663 MS M997 Los AlamosNM87545 United States Department of Computer Science University at Albany State University of New York AlbanyNY12222 United States Department of Computer Science University of California Los AngelesCA90095-1596 United States Institute for Theoretical Computer Science ETH Zürich8092 Switzerland
We consider the problem of partitioning the nodes of a com-plete edge weighted graph into k clusters so as to minimize the sum of the diameters of the clusters. Since the problem is NP-complete, our focus is on the de... 详细信息
来源: 评论
approximation algorithms for generalized bounded tree cover  10th
Approximation algorithms for generalized bounded tree cover
收藏 引用
10th International Workshop on algorithms and Computation, WALCOM 2016
作者: Gorain, Barun Mandal, Partha Sarathi Mukhopadhyaya, Krishnendu Indian Statistical Institute Kolkata India Indian Institute of Technology Guwahati Guwahati India
A tree cover is a collection of subtrees of a graph such that each vertex is a part of at least one subtree. The bounded tree cover problem (BTC) requires to find a tree cover with minimum number of subtrees of bounde... 详细信息
来源: 评论
approximation algorithms for maximum two-dimensional pattern matching  7th
收藏 引用
Proceedings of the 1996 7th Annual Symposium on Combinatorial Pattern Matching, CPM'96
作者: Arikati, Srinivasa R. Dessmark, Anders Lingas, Andrzej Marathe, Madhav Department of Mathematical Sciences University of Memphis Memphis 38152 TN United States Department of Computer Science Lund University Box 117 Lurid S-221 00 Sweden Los Alamos National Laboratory P.O. Box 1663 Los Alamos MS K990 NM United States Department of Computer Science Lund University Sweden Max-Planck-Institut fuer Informatik Saarbruecken Germany
We introduce the following optimization version of the classical pattern matching problem (referred to as the maximum pattern matching problem). Given a two-dimensional rectangular text and a 2- dimensional rectangula... 详细信息
来源: 评论
approximation algorithms for restoration capacity planning  7th
收藏 引用
7th Annual European Symposium on algorithms, ESA 1999
作者: Phillips, Steven J. Westbrook, Jeffery R. AT and T Labs–Research AT and T Shannon Laboratory 180 Park Ave Florham ParkNJ07932 United States
Amajor task of telecommunication network planners is deciding where spare capacity is needed, and howmuch, so that interrupted traffic may be rerouted in the event of a failure. Planning the spare capacity so as to mi... 详细信息
来源: 评论