咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 3,220 篇 approximation al...
  • 222 篇 scheduling
  • 80 篇 combinatorial op...
  • 72 篇 approximation al...
  • 68 篇 np-hard
  • 68 篇 computational co...
  • 65 篇 np-hardness
  • 63 篇 linear programmi...
  • 61 篇 np-complete
  • 55 篇 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...
  • 42 篇 dynamic programm...

机构

  • 52 篇 univ alberta dep...
  • 49 篇 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

语言

  • 2,991 篇 英文
  • 216 篇 其他
  • 13 篇 中文
  • 3 篇 法文
  • 2 篇 德文
检索条件"主题词=Approximation Algorithm"
3220 条 记 录,以下是71-80 订阅
排序:
A constant factor approximation algorithm for the fault-tolerant facility location problem
收藏 引用
JOURNAL OF algorithmS-COGNITION INFORMATICS AND LOGIC 2003年 第2期48卷 429-440页
作者: Guha, S Meyerson, A Munagala, K Univ Penn Dept Comp Informat Sci Philadelphia PA 19104 USA Stanford Univ Dept Comp Sci Palo Alto CA 94305 USA
We consider a generalization of the classical facility location problem, where we require the solution to be fault-tolerant. In this generalization, every demand point j must be served by r(j) facilities instead of ju... 详细信息
来源: 评论
An 0.828-approximation algorithm for the uncapacitated facility location problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 1999年 第2-3期93卷 149-156页
作者: Ageev, AA Sviridenko, MI Sobolev Inst Math Novosibirsk 630090 Russia
The uncapacitated facility location problem in the following formulation is considered: max(S subset of or equal to I) Z(S) = Sigma(j is an element of J)max(i is an element of S)b(ij) - Sigma(i is an element of S)c(i)... 详细信息
来源: 评论
A 1.75-approximation algorithm for unsigned translocation distance
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2007年 第7期73卷 1045-1059页
作者: Cui, Yun Wang, Lusheng Zhu, Daming Shandong Univ Sch Comp Sci & Technol Shandong Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China
The translocation operation is one of the popular operations for genome rearrangement. In this paper, we present a algorithm for computing unsigned translocation distance which improves upon the best known 2-approxima... 详细信息
来源: 评论
A Primal-Dual approximation algorithm for the Facility Location Problem with Submodular Penalties
收藏 引用
algorithmICA 2012年 第1-2期63卷 191-200页
作者: Du, Donglei Lu, Ruixing Xu, Dachuan Beijing Univ Technol Dept Appl Math Beijing 100124 Peoples R China Univ New Brunswick Fac Business Adm Fredericton NB E3B 5A3 Canada
We consider the facility location problem with submodular penalties (FLPSP), introduced by Hayrapetyan et al. (Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete algorithms (SODA), pp. 933-942, 2005), ... 详细信息
来源: 评论
An approximation algorithm for the l-pseudoforest deletion problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2020年 806卷 446-454页
作者: Lin, Mugang Feng, Qilong Fu, Bin Wang, Jianxin Cent S Univ Sch Comp Sci & Engn Changsha Peoples R China Hengyang Normal Univ Sch Comp Sci & Technol Hengyang Peoples R China Hunan Prov Key Lab Intelligent Informat Proc & Ap Hengyang Peoples R China Univ Texas Rio Grande Valley Dept Comp Sci Edinburg TX 78539 USA
An l-pseudoforest is a graph each of whose connected components is at most I edges removal being a tree. The l-Pseudoforest Deletion problem is to delete a vertex set P of minimum weight from a given vertex-weighted g... 详细信息
来源: 评论
An almost four-approximation algorithm for maximum weight triangulation
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2010年 第1期19卷 31-42页
作者: Hu, Shiyan Michigan Technol Univ Dept Elect & Comp Engn Houghton MI 49931 USA
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in triangulation is maximized. We prove an Om... 详细信息
来源: 评论
An approximation algorithm for maximum weight budgeted connected set cover
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2016年 第4期31卷 1505-1517页
作者: Ran, Yingli Zhang, Zhao Ko, Ker-I Liang, Jun Xinjiang Univ Coll Math & Syst Sci Urumqi 830046 Xinjiang Peoples R China Zhejiang Normal Univ Coll Math Phys & Informat Engn Jinhua 321004 Zhejiang Peoples R China Natl Chiao Tung Univ Dept Comp Sci Hsinchu 30050 Taiwan Univ Texas Dallas Dept Comp Sci Richardson TX 75080 USA
This paper studies approximation algorithm for the maximum weight budgeted connected set cover (MWBCSC) problem. Given an element set , a collection of sets , a weight function on , a cost function on , a connected gr... 详细信息
来源: 评论
An approximation algorithm for minimum-cost vertex-connectivity problems (vol 18, pg 21, 1997)
收藏 引用
algorithmICA 2002年 第1期34卷 98-107页
作者: Ravi, R Williamson, DP Carnegie Mellon Univ GSIA Pittsburgh PA 15213 USA IBM Corp Almaden Res Ctr San Jose CA 95120 USA
There is an error in our paper "An approximation algorithm fur Minimum-Cost Vertex-Connectivity Problems" (algorithmica (1997), 18:21-43). In that paper we considered the following problem: given an undirect... 详细信息
来源: 评论
Cost-efficient approximation algorithm for aggregation points planning in smart grid communications
收藏 引用
WIRELESS NETWORKS 2020年 第1期26卷 521-530页
作者: Li, Yue Wang, Tianyu Wang, Shaowei Nanjing Univ Nanjing Jiangsu Peoples R China Nanjing Univ Sch Elect Sci & Engn Nanjing Jiangsu Peoples R China
Smart grid is in need of an efficient communication network to guarantee reliable two-way data transmission between the control center and smart meters (SMs). In this work, a software-defined networking (SDN) based sm... 详细信息
来源: 评论
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 2006年 第16期154卷 2402-2410页
作者: Miyata, Keizo Masuyama, Shigeru Nakayama, Shin-ichi Zhao, Liang Toyohashi Univ Technol Toyohashi Aichi 4418580 Japan Univ Tokushima Fac Integrated Arts & Sci Tokushima 7708502 Japan Utsunomiya Univ Fac Engn Dept Informat Sci Utsunomiya Tochigi 3218585 Japan
The minimum vertex ranking spanning tree problem (MVRST) is to find a spanning tree of G whose vertex ranking is minimum. In this paper, we show that MVRST is NP-hard. To prove this, we polynomially reduce the 3-dimen... 详细信息
来源: 评论