咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是191-200 订阅
approximation algorithms for coupled task scheduling minimizing the sum of completion times
arXiv
收藏 引用
arXiv 2022年
作者: Fischer, David Györgyi, Péter Institute of Algorithms and Complexity Hamburg University of Technology Blohmstraße 15 Hamburg21079 Germany Institute for Computer Science and Control Eötvös Loránd Research Network Kende Str. 13-17. Budapest1111 Hungary
In this paper we consider the coupled task scheduling problem with exact delay times on a single machine with the objective of minimizing the total completion time of the jobs. We provide constant-factor approximation... 详细信息
来源: 评论
Improved approximation algorithms for the Traveling Tournament Problem  47
Improved Approximation Algorithms for the Traveling Tourname...
收藏 引用
47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022
作者: Zhao, Jingyang Xiao, Mingyu Xu, Chao University of Electronic Science and Technology of China Chengdu China
The Traveling Tournament Problem (TTP) is a well-known benchmark problem in the field of tournament timetabling, which asks us to design a double round-robin schedule such that each pair of teams plays one game in eac... 详细信息
来源: 评论
Tight approximation algorithms for Two-Dimensional Guillotine Strip Packing  49
Tight Approximation Algorithms for Two-Dimensional Guillotin...
收藏 引用
49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022
作者: Khan, Arindam Lonkar, Aditya Maiti, Arnab Sharma, Amatya Wiese, Andreas Department of Computer Science and Automation Indian Institute of Science Bangalore India Indian Institute of Technology Kharagpur India Technische Universität München Germany
In the Strip Packing problem (SP), we are given a vertical half-strip [0, W] × [0, ∞) and a set of n axis-aligned rectangles of width at most W. The goal is to find a non-overlapping packing of all rectangles in... 详细信息
来源: 评论
Geometry Meets Vectors: approximation algorithms for Multidimensional Packing  42
Geometry Meets Vectors: Approximation Algorithms for Multidi...
收藏 引用
42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022
作者: Khan, Arindam Sharma, Eklavya Sreenivas, K.V.N. Department of Computer Science and Automation Indian Institute of Science Bengaluru India Department of Industrial & Enterprise Systems Engineering University of Illinois at Urbana-Champaign IL United States
We study the generalized multidimensional bin packing problem (GVBP) that generalizes both geometric packing and vector packing. Here, we are given n rectangular items where the ith item has width w(i), height h(i), a... 详细信息
来源: 评论
Improved approximation algorithms and Lower Bounds for Search-Diversification Problems  49
Improved Approximation Algorithms and Lower Bounds for Searc...
收藏 引用
49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022
作者: Abboud, Amir Cohen-Addad, Vincent Lee, Euiwoong Manurangsi, Pasin Weizmann Institute of Science Rehovot Israel Google Research Zürich Switzerland University of Michigan Ann ArborMI United States Google Research Mountain ViewCA United States
We study several questions related to diversifying search results. We give improved approximation algorithms in each of the following problems, together with some lower bounds. 1. We give a polynomial-time approximati... 详细信息
来源: 评论
Faster Exponential-Time approximation algorithms Using Approximate Monotone Local Search  30
Faster Exponential-Time Approximation Algorithms Using Appro...
收藏 引用
30th Annual European Symposium on algorithms, ESA 2022
作者: Esmer, Bariş Can Kulik, Ariel Marx, Dániel Neuen, Daniel Sharma, Roohani CISPA Helmholtz Center for Information Security Saarbrücken Germany Saarbrücken Graduate School of Computer Science Saarland Informatics Campus Germany School of Computing Science Simon Fraser University Burnaby Canada Max Planck Institute for Informatics Saarland Informatics Campus Saarbrücken Germany
We generalize the monotone local search approach of Fomin, Gaspers, Lokshtanov and Saurabh [*** 2019], by establishing a connection between parameterized approximation and exponentialtime approximation algorithms for ... 详细信息
来源: 评论
approximation algorithms for the Min-Max $K$-Clustered Traveling Salesmen Problems
SSRN
收藏 引用
SSRN 2022年
作者: Bao, Xiaoguang Xu, Lei Yu, Wei Song, Wei College of Information Technology Shanghai Ocean University Shanghai201306 China School of Mathematics East China University of Science and Technology Shanghai200237 China
Given a complete undirected graph $G=(V,E)$, where $V$ is the vertex set partitioned into $K$ \emph{clusters} $V_1,V_2,\dots,V_K$ and $E$ is the edge set with edge weights satisfying triangle inequality, and a positiv... 详细信息
来源: 评论
approximation algorithms for covering vertices by long paths
arXiv
收藏 引用
arXiv 2022年
作者: Gong, Mingyang Edgar, Brett Fan, Jing Lin, Guohui Miyano, Eiji Department of Computing Science University of Alberta Edmonton Canada College of Arts and Sciences Shanghai Polytechnic University Shanghai China Department of Artificial Intelligence Kyushu Institute of Technology Iizuka Japan
Given a graph, the general problem to cover the maximum number of vertices by a collection of vertex-disjoint long paths seemingly escapes from the literature. A path containing at least k vertices is considered long.... 详细信息
来源: 评论
approximation algorithms for Drone Delivery Packing Problem
arXiv
收藏 引用
arXiv 2022年
作者: Jana, Saswata Mandal, Partha Sarathi Indian Institute of Technology Guwahati Guwahati India
Recent advancements in unmanned aerial vehicles, also known as drones, have motivated logistics to use drones for multiple operations. Collaboration between drones and trucks in a last-mile delivery system has numerou... 详细信息
来源: 评论
Two approximation algorithms for Reliability Assessment of Multi-State Systems under A Markovian Environment  27
Two Approximation Algorithms for Reliability Assessment of M...
收藏 引用
27th ISSAT International Conference on Reliability and Quality in Design
作者: Tao, Jiang Yu, Liu School of Mechanical and Electrical Engineering University of Electronic Science and Technology of China Sichuan Chengdu China
Multi-state system (MSS) reliability theory has received considerable popularity in the last few decades. However, only a few studies have considered the effect of stochastic dynamic environments on the deterioration ... 详细信息
来源: 评论