咨询与建议

限定检索结果

文献类型

  • 22,842 篇 会议
  • 9,117 篇 期刊文献
  • 64 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 16,011 篇 工学
    • 10,098 篇 计算机科学与技术...
    • 4,885 篇 电气工程
    • 3,122 篇 软件工程
    • 2,683 篇 信息与通信工程
    • 1,951 篇 控制科学与工程
    • 738 篇 机械工程
    • 679 篇 电子科学与技术(可...
    • 605 篇 航空宇航科学与技...
    • 532 篇 仪器科学与技术
    • 229 篇 交通运输工程
    • 212 篇 材料科学与工程(可...
    • 195 篇 化学工程与技术
    • 171 篇 生物工程
    • 153 篇 测绘科学与技术
    • 134 篇 土木工程
    • 134 篇 生物医学工程(可授...
    • 133 篇 动力工程及工程热...
  • 10,437 篇 理学
    • 9,372 篇 数学
    • 874 篇 物理学
    • 766 篇 系统科学
    • 737 篇 统计学(可授理学、...
    • 265 篇 生物学
    • 235 篇 化学
    • 126 篇 地球物理学
  • 2,490 篇 管理学
    • 1,927 篇 管理科学与工程(可...
    • 674 篇 工商管理
    • 557 篇 图书情报与档案管...
  • 418 篇 经济学
    • 387 篇 应用经济学
  • 211 篇 医学
    • 175 篇 临床医学
  • 180 篇 法学
    • 167 篇 社会学
  • 128 篇 文学
  • 128 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 32,023 篇 approximation al...
  • 2,737 篇 algorithm design...
  • 2,345 篇 optimization
  • 2,306 篇 approximation me...
  • 2,167 篇 heuristic algori...
  • 1,423 篇 linear programmi...
  • 1,411 篇 convergence
  • 1,278 篇 computational mo...
  • 1,216 篇 resource managem...
  • 1,141 篇 signal processin...
  • 956 篇 computer science
  • 914 篇 polynomials
  • 909 篇 complexity theor...
  • 908 篇 clustering algor...
  • 789 篇 mathematical mod...
  • 752 篇 vectors
  • 712 篇 programming
  • 652 篇 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,298 篇 英文
  • 573 篇 其他
  • 113 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 2 篇 西班牙文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
32023 条 记 录,以下是281-290 订阅
排序:
approximation algorithms for demand strip packing
arXiv
收藏 引用
arXiv 2021年
作者: Gálvez, Waldo Grandoni, Fabrizio Ameli, Afrouz Jabal Khodamoradi, Kamyar Technical University of Munich Germany IDSIA USI-SUPSI Switzerland University of Würzburg Germany
In the Demand Strip Packing problem (DSP), we are given a time interval and a collection of tasks, each characterized by a processing time and a demand for a given resource (such as electricity, computational power, e... 详细信息
来源: 评论
approximation algorithms for Min-max-min Robust Optimization and K-Adaptability under Objective Uncertainty
arXiv
收藏 引用
arXiv 2021年
作者: Kurtz, Jannis Amsterdam Business School University of Amsterdam Amsterdam1018 TV Netherlands
In this work we investigate the min-max-min robust optimization problem and the kadaptability robust optimization problem for binary problems with uncertain costs. The idea of the first approach is to calculate a set ... 详细信息
来源: 评论
approximation algorithms for priority Steiner tree problems
arXiv
收藏 引用
arXiv 2021年
作者: Sahneh, Faryad Darabi Kobourov, Stephen Spence, Richard University of Arizona TucsonAZ85721 United States
In the Priority Steiner Tree (PST) problem, we are given an undirected graph G = (V, E) with a source s ∈ V and terminals T ⊆ V \ {s}, where each terminal v ∈ T requires a nonnegative priority P(v). The goal is to c... 详细信息
来源: 评论
Minimum Age of Information TDMA Scheduling: approximation algorithms and Hardness Results
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2020年 第12期66卷 7652-7671页
作者: Kuo, Tung-Wei Natl Chengchi Univ Dept Comp Sci Taipei 11605 Taiwan
We consider a transmission scheduling problem in which multiple agents receive update information through a shared Time Division Multiple Access (TDMA) channel. To provide timely delivery of update information, the pr... 详细信息
来源: 评论
Different approximation algorithms for Channel Scheduling in Wireless Networks
收藏 引用
MOBILE INFORMATION SYSTEMS 2020年 第1期2020卷
作者: Ni, Qiufen Huang, Chuanhe Pardalos, Panos M. Ye, Jia Fu, Bin Wuhan Univ Sch Comp Sci Wuhan 430072 Peoples R China Collaborat Innovat Ctr Geospatial Technol Wuhan 430072 Peoples R China Univ Florida Dept Ind & Syst Engn Ctr Appl Optimizat Gainesville FL 32611 USA Higher Sch Econ LATNA Nizhnii Novgorod Russia Univ Texas Rio Grande Valley Dept Comp Sci Edinburg TX 78539 USA
We introduce a new two-side approximation method for the channel scheduling problem, which controls the accuracy of approximation in two sides by a pair of parameters (f, g). We present a series of simple and practica... 详细信息
来源: 评论
Efficient approximation algorithms for adaptive influence maximization
收藏 引用
VLDB JOURNAL 2020年 第6期29卷 1385-1406页
作者: Huang, Keke Tang, Jing Han, Kai Xiao, Xiaokui Chen, Wei Sun, Aixin Tang, Xueyan Lim, Andrew Nanyang Technol Univ Sch Comp Sci & Engn Singapore Singapore Natl Univ Singapore Dept Ind Syst Engn & Management Singapore Singapore Univ Sci & Technol China Sch Comp Sci & Technol Hefei Peoples R China Natl Univ Singapore Sch Comp Singapore Singapore Microsoft Res Beijing Peoples R China
Given a social network G and an integer k, the influence maximization (IM) problem asks for a seed set S of k nodes from G to maximize the expected number of nodes influenced via a propagation model. The majority of t... 详细信息
来源: 评论
approximation algorithms for two-bar charts packing problem
arXiv
收藏 引用
arXiv 2021年
作者: Erzin, Adil Melidi, Georgii Nazarenko, Stepan Plotnikov, Roman Sobolev Institute of Mathematics SB RAS Novosibirsk630090 Russia Novosibirsk State University Novosibirsk630090 Russia
In the Two-Bar Charts Packing Problem (2-BCPP), it is required to pack the bar charts (BCs) consisting of two bars into the horizontal unit-height strip of minimal length. The bars may move vertically within the strip... 详细信息
来源: 评论
approximation algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
收藏 引用
ACM TRANSACTIONS ON algorithms 2021年 第4期17卷 35-35页
作者: An, Hyung-Chan Kleinberg, Robert D. Shmoys, David B. Yonsei Univ Dept Comp Sci 50 Seodaemun Gu Seoul 03722 South Korea Cornell Univ Dept Comp Sci Ithaca NY 14853 USA Cornell Univ Sch ORIE Ithaca NY 14853 USA
We present the first nontrivial approximation algorithm for the bottleneck asymmetric traveling salesman problem. Given an asymmetric metric cost between n vertices, the problem is to find a Hamiltonian cycle that min... 详细信息
来源: 评论
Improved approximation algorithms for cumulative VRP with stochastic demands
收藏 引用
DISCRETE APPLIED MATHEMATICS 2020年 280卷 133-143页
作者: Gaur, Daya Ram Mudgal, Apurva Singh, Rishi Ranjan Univ Lethbridge Dept Math & Comp Sci 4401 Univ Dr Lethbridge AB Canada Indian Inst Technol Ropar Dept Comp Sci & Engn Nangal Rd Rupnagar 140001 Punjab India Indian Inst Technol Bhilai Dept Comp Sci & Engn GEC Campus Raipur 492015 Chhattisgarh India
In this paper, we give randomized approximation algorithms for stochastic cumulative VRPs for the split and unsplit deliveries. The approximation ratios are max{1 + 1.5 alpha, 3} and 6, respectively, where a is the ap... 详细信息
来源: 评论
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
收藏 引用
Journal of Graph algorithms and Applications 2022年 第2期26卷 209-224页
作者: 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... 详细信息
来源: 评论