咨询与建议

限定检索结果

文献类型

  • 2,431 篇 期刊文献
  • 770 篇 会议
  • 24 篇 学位论文
  • 4 册 图书

馆藏范围

  • 3,229 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 2,348 篇 工学
    • 2,007 篇 计算机科学与技术...
    • 477 篇 电气工程
    • 380 篇 信息与通信工程
    • 337 篇 软件工程
    • 76 篇 机械工程
    • 74 篇 控制科学与工程
    • 68 篇 电子科学与技术(可...
    • 29 篇 交通运输工程
    • 28 篇 仪器科学与技术
    • 11 篇 材料科学与工程(可...
    • 8 篇 土木工程
    • 6 篇 力学(可授工学、理...
    • 6 篇 测绘科学与技术
    • 6 篇 石油与天然气工程
    • 6 篇 生物工程
    • 3 篇 环境科学与工程(可...
  • 1,652 篇 理学
    • 1,598 篇 数学
    • 28 篇 生物学
    • 25 篇 统计学(可授理学、...
    • 19 篇 物理学
    • 12 篇 系统科学
    • 10 篇 化学
    • 3 篇 地球物理学
  • 897 篇 管理学
    • 890 篇 管理科学与工程(可...
    • 235 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 242 篇 经济学
    • 235 篇 应用经济学
    • 6 篇 理论经济学
  • 10 篇 法学
    • 8 篇 法学
  • 9 篇 医学
    • 5 篇 临床医学
  • 8 篇 军事学
  • 4 篇 农学
  • 2 篇 艺术学
  • 1 篇 教育学

主题

  • 3,229 篇 approximation al...
  • 222 篇 scheduling
  • 80 篇 combinatorial op...
  • 73 篇 approximation al...
  • 68 篇 np-hard
  • 68 篇 computational co...
  • 65 篇 np-hardness
  • 64 篇 linear programmi...
  • 61 篇 np-complete
  • 56 篇 optimization
  • 53 篇 facility locatio...
  • 51 篇 traveling salesm...
  • 51 篇 graph algorithm
  • 46 篇 wireless sensor ...
  • 45 篇 worst-case analy...
  • 45 篇 vertex cover
  • 45 篇 makespan
  • 45 篇 network design
  • 43 篇 computational ge...
  • 43 篇 dynamic programm...

机构

  • 52 篇 univ alberta dep...
  • 50 篇 univ texas dalla...
  • 38 篇 shandong jianzhu...
  • 37 篇 iit dept comp sc...
  • 37 篇 nanjing univ sta...
  • 34 篇 tianjin univ tec...
  • 33 篇 city univ hong k...
  • 32 篇 univ new brunswi...
  • 31 篇 shandong normal ...
  • 29 篇 shandong univ sc...
  • 27 篇 renmin univ chin...
  • 24 篇 yunnan univ sch ...
  • 24 篇 chinese acad sci...
  • 23 篇 hangzhou dianzi ...
  • 20 篇 beijing univ tec...
  • 18 篇 zhejiang normal ...
  • 17 篇 beijing univ tec...
  • 17 篇 beijing univ tec...
  • 17 篇 univ wisconsin d...
  • 16 篇 univ texas dalla...

作者

  • 92 篇 xu dachuan
  • 52 篇 du donglei
  • 49 篇 wu weili
  • 47 篇 lin guohui
  • 44 篇 wu chenchen
  • 44 篇 zhang zhao
  • 42 篇 li deying
  • 34 篇 zhang dongmei
  • 30 篇 li min
  • 30 篇 du ding-zhu
  • 29 篇 chen yong
  • 28 篇 zhang an
  • 27 篇 yu wei
  • 25 篇 dai haipeng
  • 25 篇 liu zhaohui
  • 25 篇 wang wei
  • 25 篇 li weidong
  • 25 篇 chen guihai
  • 24 篇 dumitrescu adria...
  • 24 篇 zhang peng

语言

  • 3,001 篇 英文
  • 214 篇 其他
  • 13 篇 中文
  • 2 篇 法文
  • 1 篇 德文
检索条件"主题词=Approximation algorithm"
3229 条 记 录,以下是3031-3040 订阅
排序:
New algorithms for a simple measure of network partitioning
收藏 引用
THEORETICAL COMPUTER SCIENCE 2023年 第1期957卷
作者: Zhao, Xueyang Yan, Binghao Zhang, Peng Shandong Univ Sch Software Jinan 250101 Shandong Peoples R China
Partitioning a network into k pieces is a fundamental problem in network science. A simple measure of partitioning a network is provided by the Max k-Uncut problem. Given an nvertex undirected graph G with nonnegative... 详细信息
来源: 评论
NORA: An Approach for Transforming Network Management Policies into Automated Planning Problems
收藏 引用
SENSORS 2021年 第5期21卷 1790-1790页
作者: Rodriguez-Vivas, Angela Caicedo, Oscar Mauricio Ordonez, Armando Nobre, Jeferson Campos Granville, Lisandro Zambenedetti Univ Cauca Dept Telemat Popayan 190002 Colombia Univ Fed Rio Grande do Sul Inst Informat BR-90040060 Porto Alegre RS Brazil
Realizing autonomic management control loops is pivotal for achieving self-driving networks. Some studies have recently evidence the feasibility of using Automated Planning (AP) to carry out these loops. However, in p... 详细信息
来源: 评论
Minimization Problems with Non-Submodular Cover Constraint
收藏 引用
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 2023年 第5期40卷 2340012-2340012页
作者: Wang, Wenqi Liu, Zhicheng Du, Donglei Shi, Peihao Zhang, Xiaoyan Nanjing Normal Univ Sch Math Sci Nanjing 210023 Peoples R China Nanjing Normal Univ Inst Math Nanjing 210023 Peoples R China Beijing Univ Technol Beijing Inst Sci & Engn Comp Beijing 100124 Peoples R China Univ New Brunswick Fac Management Fredericton NB E3B 9Y2 Canada Ind Technol Res Inst Co Ltd Nanjing Kinghua Operat Res & ArtificialIntelligenc Nanjing 210035 Peoples R China
The set cover problem has been studied extensively for many years. Submodular function plays a key role in combinatorial optimization. Extending the set cover problem, we consider three submodular cover problems. The ... 详细信息
来源: 评论
Approximating the directed path partition problem ☆
收藏 引用
INFORMATION AND COMPUTATION 2024年 297卷
作者: Chen, Yong Chen, Zhi-Zhong Kennedy, Curtis Lin, Guohui Xu, Yao Zhang, An Hangzhou Dianzi Univ Dept Math Hangzhou Peoples R China Tokyo Denki Univ Div Informat Syst Design Saitama Japan Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada Georgia Southern Univ Dept Comp Sci Statesboro GA USA
Given a digraph G = (V, E), the k-path partition problem aims to find a minimum collection of vertex-disjoint directed paths, of order at most k, to cover all the vertices. The problem has various applications. Its sp... 详细信息
来源: 评论
Approximating the multiple-depot multiple-terminal Hamiltonian path problem
收藏 引用
DISCRETE OPTIMIZATION 2019年 34卷 100545-000页
作者: Yang, Yichen Liu, Zhaohui East China Univ Sci & Technol Dept Math Shanghai 200237 Peoples R China
In this paper, we study a multiple-terminal extension of the classic Hamiltonian path problem where m salesmen are initially located at different depots and finally stopped at different terminals. To the best of our k... 详细信息
来源: 评论
Optimal Base Station Placement in Wireless Sensor Networks
收藏 引用
ACM TRANSACTIONS ON SENSOR NETWORKS 2009年 第4期5卷 32-32页
作者: Shi, Yi Hou, Y. Thomas Virginia Polytech Inst & State Univ Bardley Dept Elect & Comp Engn Blacksburg VA 24061 USA
Base station location has a significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particularly challenging due to its coupling with data routing. This ... 详细信息
来源: 评论
Approximating Gromov-Hausdorff distance in Euclidean space
收藏 引用
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2024年 116卷
作者: Majhi, Sushovan Vitter, Jeffrey Wenk, Carola Univ Calif Berkeley Sch Informat Berkeley CA 94720 USA Univ Mississippi Dept Comp & Informat Sci University MS 38677 USA Tulane Univ Dept Comp Sci New Orleans LA 70118 USA
The Gromov-Hausdorff distance (dGH) proves to be a useful distance measure between shapes. In order to approximate dGH for X, Y & SUB;Rd, we look into its relationship with dH,iso, the infimum Hausdorff distance u... 详细信息
来源: 评论
Improving energy efficiency in colocation data centers for demand response
收藏 引用
SUSTAINABLE COMPUTING-INFORMATICS & SYSTEMS 2021年 第PartB期29卷
作者: Chi, Ce Zhang, Fa Ji, Kaixuan Marahatta, Avinab Liu, Zhiyong Chinese Acad Sci Inst Comp Technol High Performance Comp Res Ctr Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China
Colocation data centers (colocations, for short) are developing rapidly and have become ideal participants for emergency demand response (EDR) programs. However, even colocation operators wish to save energy, they can... 详细信息
来源: 评论
Quasi-linear time heuristic to solve the Euclidean traveling salesman problem with low gap
收藏 引用
JOURNAL OF COMPUTATIONAL SCIENCE 2024年 82卷
作者: Formella, Arno Univ Vigo Vigo Spain
The traveling salesman problem (TSP) is a well studied NP-hard optimization problem. We present a novel heuristic to find approximate solutions for the case of the TSP with Euclidean metric. Our pair-center algorithm ... 详细信息
来源: 评论
Efficient algorithms for Max-Weighted Point Sweep Coverage on Lines
收藏 引用
SENSORS 2021年 第4期21卷 1457-1457页
作者: Liang, Dieyan Shen, Hong Sun Yat Sen Univ Sch Comp Sci & Engn Guangzhou 510275 Peoples R China
As an important application of wireless sensor networks (WSNs), deployment of mobile sensors to periodically monitor (sweep cover) a set of points of interest (PoIs) arises in various applications, such as environment... 详细信息
来源: 评论