咨询与建议

限定检索结果

文献类型

  • 22,935 篇 会议
  • 9,257 篇 期刊文献
  • 50 篇 学位论文

馆藏范围

  • 32,242 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 16,166 篇 工学
    • 10,225 篇 计算机科学与技术...
    • 4,934 篇 电气工程
    • 3,195 篇 软件工程
    • 2,715 篇 信息与通信工程
    • 1,960 篇 控制科学与工程
    • 741 篇 机械工程
    • 684 篇 电子科学与技术(可...
    • 608 篇 航空宇航科学与技...
    • 541 篇 仪器科学与技术
    • 235 篇 交通运输工程
    • 214 篇 材料科学与工程(可...
    • 196 篇 化学工程与技术
    • 170 篇 生物工程
    • 160 篇 测绘科学与技术
    • 140 篇 土木工程
    • 135 篇 生物医学工程(可授...
    • 133 篇 动力工程及工程热...
  • 10,522 篇 理学
    • 9,446 篇 数学
    • 884 篇 物理学
    • 769 篇 系统科学
    • 751 篇 统计学(可授理学、...
    • 266 篇 生物学
    • 238 篇 化学
    • 127 篇 地球物理学
  • 2,506 篇 管理学
    • 1,936 篇 管理科学与工程(可...
    • 678 篇 工商管理
    • 564 篇 图书情报与档案管...
  • 420 篇 经济学
    • 389 篇 应用经济学
  • 212 篇 医学
    • 175 篇 临床医学
  • 182 篇 法学
    • 169 篇 社会学
  • 129 篇 文学
  • 129 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 32,242 篇 approximation al...
  • 2,736 篇 algorithm design...
  • 2,379 篇 optimization
  • 2,305 篇 approximation me...
  • 2,189 篇 heuristic algori...
  • 1,429 篇 linear programmi...
  • 1,425 篇 convergence
  • 1,292 篇 computational mo...
  • 1,229 篇 resource managem...
  • 1,149 篇 signal processin...
  • 956 篇 computer science
  • 924 篇 polynomials
  • 921 篇 clustering algor...
  • 920 篇 complexity theor...
  • 788 篇 mathematical mod...
  • 763 篇 vectors
  • 711 篇 programming
  • 659 篇 estimation
  • 634 篇 training
  • 614 篇 transportation

机构

  • 97 篇 univ maryland de...
  • 66 篇 technion israel ...
  • 55 篇 univ waterloo de...
  • 48 篇 cornell univ dep...
  • 44 篇 tsinghua univers...
  • 39 篇 carnegie mellon ...
  • 38 篇 national institu...
  • 38 篇 iit dept comp sc...
  • 35 篇 national mobile ...
  • 34 篇 shandong univ sc...
  • 32 篇 sichuan univ col...
  • 32 篇 nanjing univ sta...
  • 31 篇 school of comput...
  • 29 篇 hong kong polyte...
  • 29 篇 univ chinese aca...
  • 29 篇 technion haifa
  • 29 篇 princeton univ p...
  • 29 篇 suny stony brook...
  • 28 篇 epfl
  • 28 篇 tel aviv univers...

作者

  • 65 篇 woodruff david p...
  • 63 篇 ravi r.
  • 52 篇 kortsarz guy
  • 45 篇 lee euiwoong
  • 43 篇 levin asaf
  • 42 篇 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
  • 28 篇 saha barna
  • 28 篇 dinitz michael
  • 27 篇 shmoys david b.

语言

  • 30,821 篇 英文
  • 1,287 篇 其他
  • 116 篇 中文
  • 9 篇 日文
  • 8 篇 俄文
  • 3 篇 法文
  • 2 篇 西班牙文
  • 1 篇 土耳其文
  • 1 篇 乌克兰文
检索条件"主题词=approximation algorithms"
32242 条 记 录,以下是281-290 订阅
排序:
Exact and approximation algorithms for Many-To-Many Point Matching in the Plane  32
Exact and Approximation Algorithms for Many-To-Many Point Ma...
收藏 引用
32nd International Symposium on algorithms and Computation, ISAAC 2021
作者: Bandyapadhyay, Sayan Maheshwari, Anil Smid, Michiel Department of Informatics University of Bergen Norway School of Computer Science Carleton University Ottawa Canada
Given two sets S and T of points in the plane, of total size n, a many-to-many matching between S and T is a set of pairs (p, q) such that p ∈ S, q ∈ T and for each r ∈ S ∪ T, r appears in at least one such pair. ... 详细信息
来源: 评论
Quantum and approximation algorithms for Maximum Witnesses of Boolean Matrix Products  7th
Quantum and Approximation Algorithms for Maximum Witnesses o...
收藏 引用
7th International Conference on algorithms and Discrete Applied Mathematics, CALDAM 2021
作者: Kowaluk, Miroslaw Lingas, Andrzej Institute of Informatics University of Warsaw Warsaw Poland Department of Computer Science Lund University Lund22100 Sweden
The problem of finding maximum (or minimum) witnesses of the Boolean product of two Boolean matrices (MW for short) has a number of important applications, in particular the all-pairs lowest common ancestor (LCA) prob... 详细信息
来源: 评论
Certified approximation algorithms for the fermat point and n-ellipses  29
Certified approximation algorithms for the fermat point and ...
收藏 引用
29th Annual European Symposium on algorithms, ESA 2021
作者: Junginger, Kolja Mantas, Ioannis Papadopoulou, Evanthia Suderland, Martin Yap, Chee Faculty of Informatics Università della Svizzera Italiana Lugano Switzerland Courant Institute New York University NY United States
Given a set A of n points in Rd with weight function w : A → R>0, the Fermat distance function is φ(x):= Pa∈A w(a)x−a. A classic problem in facility location dating back to 1643, is to find the Fermat point x∗, ... 详细信息
来源: 评论
approximation algorithms FOR SIZE-CONSTRAINED NON-MONOTONE SUBMODULAR MAXIMIZATION IN DETERMINISTIC LINEAR TIME
arXiv
收藏 引用
arXiv 2021年
作者: Chen, Yixin Kuhnle, Alan Department of Computer Science & Engineering Texas A&M University College StationTX United States
In this work, we study the problem of finding the maximum value of a non-negative submodular function subject to a limit on the number of items selected, a ubiquitous problem that appears in many applications, such as... 详细信息
来源: 评论
FPT and FPT-approximation algorithms for unsplittable flow on trees  29
FPT and FPT-approximation algorithms for unsplittable flow o...
收藏 引用
29th Annual European Symposium on algorithms, ESA 2021
作者: Martínez-Muñoz, Tomás Wiese, Andreas Mathematical Engineering Department University of Chile Santiago Chile Department of Industrial Engineering University of Chile Santiago Chile
We study the unsplittable flow on trees (UFT) problem in which we are given a tree with capacities on its edges and a set of tasks, where each task is described by a path and a demand. Our goal is to select a subset o... 详细信息
来源: 评论
Better approximation algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-Free Graphs  15th
Better Approximation Algorithms for Maximum Weight Internal ...
收藏 引用
15th International Conference on algorithms and Computation, WALCOM 2021
作者: Biniaz, Ahmad School of Computer Science University of Windsor Windsor Canada
Given a connected vertex-weighted graph G, the maximum weight internal spanning tree (MaxwIST) problem asks for a spanning tree of G that maximizes the total weight of internal nodes. This problem is NP-hard and APX-h... 详细信息
来源: 评论
approximation algorithms for LCS and LIS with truly improved running times
arXiv
收藏 引用
arXiv 2021年
作者: Rubinstein, Aviad Seddighin, Saeed Song, Zhao Sun, Xiaorui Stanford University Toyota Technological Institute Chicago United States Adobe Research University of Illinois
Longest common subsequence (LCS) is a classic and central problem in combinatorial optimization. While LCS admits a quadratic time solution, recent evidence suggests that solving the problem may be impossible in truly... 详细信息
来源: 评论
Improved approximation algorithms for 2-dimensional knapsack: Packing into multiple L-shapes, spirals, and more  37
Improved approximation algorithms for 2-dimensional knapsack...
收藏 引用
37th International Symposium on Computational Geometry, SoCG 2021
作者: Gálvez, Waldo Grandoni, Fabrizio Khan, Arindam Ramírez-Romero, Diego Wiese, Andreas Department of Computer Science TU München Germany IDSIA USI-SUPSI Lugano Switzerland Department of Computer Science and Automation Indian Institute of Science Bangalore India Department of Mathematical Engineering Universidad de Chile Santiago Chile Department of Industrial Engineering Center for Mathematical Modeling Universidad de Chile Santiago Chile
In the 2-Dimensional Knapsack problem (2DK) we are given a square knapsack and a collection of n rectangular items with integer sizes and profits. Our goal is to find the most profitable subset of items that can be pa... 详细信息
来源: 评论
approximation algorithms for 1-Wasserstein distance between persistence diagrams
arXiv
收藏 引用
arXiv 2021年
作者: Chen, Samantha Wang, Yusu University of California San Diego United States
Recent years have witnessed a tremendous growth using topological summaries, especially the persistence diagrams (encoding the so-called persistent homology) for analyzing complex shapes. Intuitively, persistent homol... 详细信息
来源: 评论
approximation algorithms for the random-field Ising model
arXiv
收藏 引用
arXiv 2021年
作者: Helmuth, Tyler Lee, Holden Perkins, Will Ravichandran, Mohan Wu, Qiang Durham University Mathematical Sciences Department Duke University Department of Mathematics University of Illinois at Chicago Department of Mathematics Statistics and Computer Science Bogazici University Department of Mathematics University of Illinois at Urbana-Champaign Department of Mathematics
Approximating the partition function of the ferromagnetic Ising model with general external fields is known to be #BIS-hard in the worst case, even for bounded-degree graphs, and it is widely believed that no polynomi... 详细信息
来源: 评论