咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 2,345 篇 工学
    • 2,005 篇 计算机科学与技术...
    • 476 篇 电气工程
    • 378 篇 信息与通信工程
    • 337 篇 软件工程
    • 76 篇 机械工程
    • 75 篇 控制科学与工程
    • 69 篇 电子科学与技术(可...
    • 29 篇 交通运输工程
    • 28 篇 仪器科学与技术
    • 11 篇 材料科学与工程(可...
    • 8 篇 土木工程
    • 7 篇 石油与天然气工程
    • 6 篇 力学(可授工学、理...
    • 6 篇 测绘科学与技术
    • 6 篇 生物工程
  • 1,649 篇 理学
    • 1,596 篇 数学
    • 28 篇 生物学
    • 26 篇 统计学(可授理学、...
    • 18 篇 物理学
    • 11 篇 系统科学
    • 10 篇 化学
    • 3 篇 地球物理学
  • 897 篇 管理学
    • 889 篇 管理科学与工程(可...
    • 236 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 243 篇 经济学
    • 235 篇 应用经济学
    • 7 篇 理论经济学
  • 11 篇 法学
    • 8 篇 法学
    • 3 篇 社会学
  • 10 篇 医学
    • 5 篇 临床医学
  • 8 篇 军事学
  • 4 篇 农学
  • 2 篇 艺术学
  • 1 篇 教育学

主题

  • 3,226 篇 approximation al...
  • 223 篇 scheduling
  • 81 篇 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
  • 45 篇 worst-case analy...
  • 45 篇 wireless sensor ...
  • 45 篇 vertex cover
  • 45 篇 makespan
  • 45 篇 network design
  • 43 篇 computational ge...
  • 43 篇 dynamic programm...

机构

  • 52 篇 univ alberta dep...
  • 49 篇 univ texas dalla...
  • 38 篇 shandong jianzhu...
  • 37 篇 iit dept comp sc...
  • 36 篇 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 篇 liu zhaohui
  • 25 篇 wang wei
  • 25 篇 li weidong
  • 25 篇 chen guihai
  • 24 篇 dai haipeng
  • 24 篇 dumitrescu adria...
  • 24 篇 zhang peng

语言

  • 2,997 篇 英文
  • 216 篇 其他
  • 13 篇 中文
  • 3 篇 法文
  • 2 篇 德文
检索条件"主题词=Approximation algorithm"
3226 条 记 录,以下是251-260 订阅
排序:
Baseband Unit Pool Planning for Cloud Radio Access Networks: An approximation algorithm
收藏 引用
IEEE COMMUNICATIONS LETTERS 2017年 第2期21卷 358-361页
作者: Xu, Sheng Wang, Shaowei Nanjing Univ Sch Elect Sci & Engn Nanjing 210023 Jiangsu Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China
Cloud radio access networks (C-RANs) are proposed as promising architecture to improve the capacity and enhance the coverage of mobile communication systems. In this letter, we study the baseband unit (BBU) pools plan... 详细信息
来源: 评论
An approximation algorithm for square packing
收藏 引用
OPERATIONS RESEARCH LETTERS 2004年 第6期32卷 535-539页
作者: van Stee, R Ctr Math & Comp Sci NL-1098 SJ Amsterdam Netherlands
We consider the problem of packing squares into bins which are unit squares, where the goal is to minimize the number of bins used. We present an algorithm for this problem with an absolute worst-case ratio of 2, whic... 详细信息
来源: 评论
A new approximation algorithm for labeling points with circle pairs
收藏 引用
INFORMATION PROCESSING LETTERS 2006年 第4期99卷 125-129页
作者: Jiang, Minghui Utah State Univ Dept Comp Sci Logan UT 84322 USA
We study the NP-hard problem of labeling points with maximum-radius circle pairs: given n point sites in the plane, find a placement for 2n interior-disjoint uniform circles, such that each site touches two circles an... 详细信息
来源: 评论
An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第4期115卷 475-480页
作者: Dong, Jianming Jiang, Yiwei Zhang, An Hu, Jueliang Luo, Hui Zhejiang Sci Tech Univ Dept Math Hangzhou 310018 Zhejiang Peoples R China Hangzhou Dianzi Univ Inst Operat Res & Cybernet Hangzhou 310018 Zhejiang Peoples R China
In the hybrid flow shop, jobs are subjected to process through stages in series as in the classical flow shop, while each stage contains one or more identical machines. This paper mainly studies the scheduling problem... 详细信息
来源: 评论
An LP-based approximation algorithm for the generalized traveling salesman path problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2023年 941卷 180-190页
作者: Sun, Jian Gutin, Gregory Li, Ping Shi, Peihao Zhang, Xiaoyan Nankai Univ Ctr Combinator Tianjin 300071 Peoples R China Univ London Dept Comp Sci Royal Holloway Egham TW200EX Surrey England Shandong Qiguang Informat Technol Co Ltd Shandong 253000 Peoples R China Nanjing Kinghua Operat Res & Artificial Intelligen Jiangsu 210035 Peoples R China Nanjing Normal Univ Inst Math Sch Math Sci Jiangsu 210023 Peoples R China
The traveling salesman problem (TSP) is one of the classic research topics in the field of operations research, graph theory and computer science. In this paper, we propose a generalized model of traveling salesman pr... 详细信息
来源: 评论
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2003年 第2-3期126卷 275-289页
作者: Zhao, L Nagamochi, H Ibaraki, T Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Kyoto 6068501 Japan Toyohashi Univ Technol Dept Informat & Comp Sci Toyohashi Aichi 4418580 Japan
Given a hypergraph with nonnegative costs on hyperedges, and a weakly supermodular function r: 2(V) --> Z(+), where V is the vertex set, we consider the problem of finding a minimum cost subset of hyperedges such t... 详细信息
来源: 评论
A (1/2+1/60)-approximation algorithm for Maximum Weight Series-Parallel Subgraph
收藏 引用
DISCRETE APPLIED MATHEMATICS 2024年 354卷 241-261页
作者: Calinescu, Gruia Wang, Xiaolang IIT Dept Comp Sci 10 West 31st St Chicago IL 60616 USA
We improve the approximation ratio for MAXIMUM WEIGHT SERIES-PARALLEL SUBGRAPH from 1 / 2 to 1 / 2 + 1 / 60. (c) 2023 Elsevier B.V. All rights reserved.
来源: 评论
AN approximation algorithm FOR FULLY PLANAR EDGE-DISJOINT PATHS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2021年 第2期35卷 752-769页
作者: Huang, Chien-Chung Mari, Mathieu Mathieu, Claire Schewior, Kevin Vygen, Jens Univ PSL Ecole Normale Super CNRS F-75005 Paris France Univ PSL Comp Sci Dept Ecole Normale Super F-75005 Paris France Univ Paris CNRS IRIF F-75205 Paris France Univ Cologne Dept Math Informat D-50931 Cologne Germany Univ Bonn Hausdorff Ctr Math Res Inst Discrete Math D-53113 Bonn Germany
We devise a constant-factor approximation algorithm for the maximization version of the edge-disjoint paths problem if the supply graph together with the demand edges forms a planar graph. By planar duality, this is e... 详细信息
来源: 评论
A Bifactor approximation algorithm for Cloudlet Placement in Edge Computing
收藏 引用
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2022年 第8期33卷 1787-1798页
作者: Bhatta, Dixit Mashayekhy, Lena Univ Delaware Dept Comp & Informat Sci Newark DE 19716 USA
Emerging applications with low-latency requirements such as real-time analytics, immersive media applications, and intelligent virtual assistants have rendered Edge Computing as a critical computing infrastructure. Ex... 详细信息
来源: 评论
A FASTER approximation algorithm FOR THE STEINER PROBLEM IN GRAPHS
收藏 引用
INFORMATION PROCESSING LETTERS 1988年 第3期27卷 125-128页
作者: MEHLHORN, K Fachbereich 10—Informatik Universität des Saarlandes D-6600 Saarbrücken Germany Fed. Rep. Germany
Kou, Markowsy, and Berman (1981) described a procedure for finding a Steiner tree for a connected, undirected distance graph with a specified subset of the set of vertices. A new implementation of that 1981 algorithm... 详细信息
来源: 评论