咨询与建议

限定检索结果

文献类型

  • 22,933 篇 会议
  • 9,215 篇 期刊文献
  • 50 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 16,122 篇 工学
    • 10,191 篇 计算机科学与技术...
    • 4,918 篇 电气工程
    • 3,183 篇 软件工程
    • 2,703 篇 信息与通信工程
    • 1,962 篇 控制科学与工程
    • 741 篇 机械工程
    • 684 篇 电子科学与技术(可...
    • 606 篇 航空宇航科学与技...
    • 539 篇 仪器科学与技术
    • 233 篇 交通运输工程
    • 214 篇 材料科学与工程(可...
    • 197 篇 化学工程与技术
    • 171 篇 生物工程
    • 158 篇 测绘科学与技术
    • 140 篇 土木工程
    • 135 篇 生物医学工程(可授...
    • 133 篇 动力工程及工程热...
  • 10,500 篇 理学
    • 9,428 篇 数学
    • 880 篇 物理学
    • 770 篇 系统科学
    • 747 篇 统计学(可授理学、...
    • 267 篇 生物学
    • 239 篇 化学
    • 127 篇 地球物理学
  • 2,504 篇 管理学
    • 1,935 篇 管理科学与工程(可...
    • 678 篇 工商管理
    • 563 篇 图书情报与档案管...
  • 420 篇 经济学
    • 389 篇 应用经济学
  • 211 篇 医学
    • 175 篇 临床医学
  • 182 篇 法学
    • 169 篇 社会学
  • 129 篇 文学
  • 129 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 32,198 篇 approximation al...
  • 2,737 篇 algorithm design...
  • 2,374 篇 optimization
  • 2,306 篇 approximation me...
  • 2,190 篇 heuristic algori...
  • 1,429 篇 linear programmi...
  • 1,422 篇 convergence
  • 1,293 篇 computational mo...
  • 1,227 篇 resource managem...
  • 1,146 篇 signal processin...
  • 955 篇 computer science
  • 921 篇 polynomials
  • 919 篇 clustering algor...
  • 916 篇 complexity theor...
  • 788 篇 mathematical mod...
  • 754 篇 vectors
  • 711 篇 programming
  • 658 篇 estimation
  • 633 篇 training
  • 614 篇 transportation

机构

  • 97 篇 univ maryland de...
  • 68 篇 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...
  • 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...

作者

  • 65 篇 woodruff david p...
  • 63 篇 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
  • 28 篇 saha barna
  • 28 篇 dinitz michael
  • 27 篇 shmoys david b.

语言

  • 30,777 篇 英文
  • 1,287 篇 其他
  • 117 篇 中文
  • 9 篇 日文
  • 6 篇 俄文
  • 3 篇 法文
  • 2 篇 西班牙文
  • 1 篇 土耳其文
  • 1 篇 乌克兰文
检索条件"主题词=approximation algorithms"
32198 条 记 录,以下是221-230 订阅
排序:
approximation algorithms for job scheduling with block-type conflict graphs
arXiv
收藏 引用
arXiv 2022年
作者: Furmańczyk, Hanna Pikies, Tytus Sokolowska, Inka Turowski, Krzysztof Institute of Informatics Faculty of Mathematics Physics and Informatics University of Gdańsk Gdańsk80-309 Poland Department of Algorithms and System Modeling Gdańsk University of Technology Poland Theoretical Computer Science Department Jagiellonian University Poland
The problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No... 详细信息
来源: 评论
Nash Social Welfare with Submodular Valuations: approximation algorithms and Integrality Gaps
arXiv
收藏 引用
arXiv 2025年
作者: Bei, Xiaohui Feng, Yuda Hu, Yang Li, Shi Zhang, Ruilong Division of Mathematical Sciences Nanyang Technological University Singapore School of Computer Science Nanjing University Nanjing China Institute for Interdisciplinary Information Sciences Tsinghua University Peking China Department of Mathematics Technical University of Munich Munich Germany
We study the problem of allocating items to agents such that the (un)weighted Nash social welfare (NSW) is maximized under submodular valuations. The best-known results for unweighted and weighted problems are the (4 ... 详细信息
来源: 评论
From Theory to Practice: Engineering approximation algorithms for Dynamic Orientation
arXiv
收藏 引用
arXiv 2025年
作者: Großmann, Ernestine van der Hoog, Ivor Reinstädtler, Henrik Rotenberg, Eva Schulz, Christian Vlieghe, Juliette Heidelberg University Germany Technical University of Denmark Denmark
Dynamic graph algorithms have seen significant theoretical advancements, but practical evaluations often lag behind. This work bridges the gap between theory and practice by engineering and empirically evaluating rece... 详细信息
来源: 评论
Complexity and approximation algorithms for Fixed Charge Transportation Problems
arXiv
收藏 引用
arXiv 2025年
作者: Chen, Yong Li, Shi Liang, Zihao Department of Mathematics Hangzhou Dianzi University Zhejiang Province Hangzhou China School of Computer Science Nanjing University Jiangsu Province Nanjing China
The Fixed Charge Transportation (FCT) problem models transportation scenarios where we need to send a commodity from n sources to m sinks, and the cost of sending a commodity from a source to a sink consists of a line... 详细信息
来源: 评论
Automating the Search for Small Hard Examples to approximation algorithms
arXiv
收藏 引用
arXiv 2025年
作者: Sharma, Eklavya University of Illinois Urbana-Champaign United States
Given an approximation algorithm A, we want to find the input with the worst approximation ratio, i.e., the input for which A’s output’s objective value is the worst possible compared to the optimal solution’s obje... 详细信息
来源: 评论
Improved approximation algorithms for Three-Dimensional Knapsack
arXiv
收藏 引用
arXiv 2025年
作者: Jansen, Klaus Kar, Debajyoti Khan, Arindam Sreenivas, K.V.N. Tutas, Malte Kiel University Kiel Germany Indian Institute of Science Bengaluru India
We study the three-dimensional Knapsack (3DK) problem, in which we are given a set of axis-aligned cuboids with associated profits and an axis-aligned cube knapsack. The objective is to find a non-overlapping axis-ali... 详细信息
来源: 评论
Parameterized and approximation algorithms for coverings points with segments in the plane
arXiv
收藏 引用
arXiv 2024年
作者: Kowalska, Katarzyna Pilipczuk, Michal University of Warsaw Poland
We study parameterized and approximation algorithms for a variant of Set Cover, where the universe of elements to be covered consists of points in the plane and the sets with which the points should be covered are seg... 详细信息
来源: 评论
Improved approximation algorithms for Three-Dimensional Bin Packing
arXiv
收藏 引用
arXiv 2025年
作者: Kar, Debajyoti Khan, Arindam Rau, Malin Department of Computer Science and Automation Indian Institute of Science Bengaluru India Department of Mathematical Sciences Chalmers University of Technology University of Gothenburg GöteborgSE-412 96 Sweden
We study three fundamental three-dimensional (3D) geometric packing problems: 3D (Geometric) Bin Packing (3d-bp), 3D Strip Packing (3d-sp), and Minimum Volume Bounding Box (3d-mvbb), where given a set of 3D (rectangul... 详细信息
来源: 评论
Fast approximation algorithms for scheduling uniform parallel batch machines with inclusive processing set restriction
Fast approximation algorithms for scheduling uniform paralle...
收藏 引用
Advanced algorithms and Control Engineering (ICAACE), International Conference on
作者: Yanyue Liang Lihong Zhang Shuguang Li School of Computer Science and Technology Shandong Technology and Business University Yantai China
We address the problem on uniform parallel batch machines to minimize makespan where each job is restricted to a specific subset of machines, known as its processing set. Batch machines have diverse speeds and capacit... 详细信息
来源: 评论
Improved approximation algorithms for Flexible Graph Connectivity and Capacitated Network Design
arXiv
收藏 引用
arXiv 2024年
作者: Bansal, Ishan Cheriyan, Joseph Khanna, Sanjeev Simmons, Miles Amazon BellevueWA United States Department of Combinatorics & Optimization University of Waterloo Canada University of Pennsylvania PhiladelphiaPA United States
We present improved approximation algorithms for some problems in the related areas of Flexible Graph Connectivity and Capacitated Network Design. In the (p, q)-Flexible Graph Connectivity problem, denoted (p, q)-FGC,... 详细信息
来源: 评论