咨询与建议

限定检索结果

文献类型

  • 2,443 篇 期刊文献
  • 773 篇 会议
  • 15 篇 学位论文
  • 4 册 图书

馆藏范围

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

日期分布

学科分类号

  • 2,329 篇 工学
    • 2,017 篇 计算机科学与技术...
    • 476 篇 电气工程
    • 349 篇 信息与通信工程
    • 338 篇 软件工程
    • 76 篇 机械工程
    • 75 篇 控制科学与工程
    • 70 篇 电子科学与技术(可...
    • 28 篇 仪器科学与技术
    • 28 篇 交通运输工程
    • 11 篇 材料科学与工程(可...
    • 8 篇 土木工程
    • 6 篇 力学(可授工学、理...
    • 6 篇 测绘科学与技术
    • 6 篇 石油与天然气工程
    • 6 篇 生物工程
    • 3 篇 环境科学与工程(可...
    • 3 篇 网络空间安全
  • 1,661 篇 理学
    • 1,606 篇 数学
    • 28 篇 生物学
    • 26 篇 统计学(可授理学、...
    • 19 篇 物理学
    • 11 篇 系统科学
    • 10 篇 化学
    • 4 篇 地球物理学
  • 905 篇 管理学
    • 898 篇 管理科学与工程(可...
    • 240 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 244 篇 经济学
    • 240 篇 应用经济学
    • 3 篇 理论经济学
  • 8 篇 医学
    • 5 篇 临床医学
  • 8 篇 军事学
  • 4 篇 法学
  • 4 篇 农学
  • 2 篇 艺术学
  • 1 篇 教育学

主题

  • 3,235 篇 approximation al...
  • 225 篇 scheduling
  • 81 篇 combinatorial op...
  • 72 篇 approximation al...
  • 69 篇 computational co...
  • 68 篇 np-hard
  • 65 篇 np-hardness
  • 62 篇 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
  • 44 篇 network design
  • 43 篇 computational ge...
  • 42 篇 dynamic programm...

机构

  • 53 篇 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...
  • 19 篇 zhejiang normal ...
  • 17 篇 beijing univ tec...
  • 17 篇 beijing univ tec...
  • 17 篇 univ wisconsin d...
  • 16 篇 univ texas dalla...

作者

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

语言

  • 2,999 篇 英文
  • 208 篇 其他
  • 14 篇 中文
检索条件"主题词=approximation algorithm"
3235 条 记 录,以下是161-170 订阅
排序:
An approximation algorithm for soft capacitated k-facility location problem
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2018年 第2期35卷 493-511页
作者: Jiang, Yanjun Xu, Dachuan Du, Donglei Wu, Chenchen Zhang, Dongmei Beijing Univ Technol Dept Informat & Operat Res Coll Appl Sci 100 Pingleyuan Beijing 100124 Peoples R China Univ New Brunswick Fac Business Adm Fredericton NB E3B 5A3 Canada Tianjin Univ Technol Coll Sci Tianjin 300384 Peoples R China Shandong Jianzhu Univ Sch Comp Sci & Technol Jinan 250101 Shandong Peoples R China
We present a -approximation algorithm for the non-uniform soft capacitated k-facility location problem, violating the capacitated constrains by no more than a factor of 25. The main technique is based on the primal-du... 详细信息
来源: 评论
A local search approximation algorithm for a squared metric k-facility location problem
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2018年 第4期35卷 1168-1184页
作者: Zhang, Dongmei Xu, Dachuan Wang, Yishui Zhang, Peng Zhang, Zhenning Shandong Jianzhu Univ Sch Comp Sci & Technol Jinan 250101 Shandong Peoples R China Beijing Univ Technol Beijing Inst Sci & Engn Comp 100 Pingleyuan Beijing 100124 Peoples R China Beijing Univ Technol Dept Informat & Operat Res Coll Appl Sci 100 Pingleyuan Beijing 100124 Peoples R China Shandong Univ Sch Comp Sci & Technol Jinan 250101 Shandong Peoples R China
In this paper, we introduce a squared metric k-facility location problem (SM-k-FLP) which is a generalization of the squared metric facility location problem and k-facility location problem (k-FLP). In the SM-k-FLP, w... 详细信息
来源: 评论
An Improved approximation algorithm for Knapsack Median Using Sparsification
收藏 引用
algorithmICA 2018年 第4期80卷 1093-1114页
作者: Byrka, Jaroslaw Pensyl, Thomas Rybicki, Bartosz Spoerhase, Joachim Srinivasan, Aravind Khoa Trinh Univ Wroclaw Inst Comp Sci Wroclaw Poland Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland Inst Adv Comp Studies College Pk MD 20742 USA
Knapsack median is a generalization of the classic k-median problem in which we replace the cardinality constraint with a knapsack constraint. It is currently known to be 32-approximable. We improve on the best known ... 详细信息
来源: 评论
An approximation algorithm for the k-median problem with uniform penalties via pseudo-solution
收藏 引用
THEORETICAL COMPUTER SCIENCE 2018年 749卷 80-92页
作者: Wu, Chenchen Du, Donglei Xu, Dachuan Tianjin Univ Technol Coll Sci 399 Binshui West St Tianjin Peoples R China Univ New Brunswick Fac Business Adm Fredericton NB E3B 5A3 Canada Beijing Univ Technol Beijing Inst Sci & Engn Comp 100 Pingleyuan Beijing 100124 Peoples R China
We present a (1 + root 3 + is an element of)-approximation algorithm for the k-median problem with uniform penalties, extending the recent result by Li and Svensson for the classical k-median problem without penalties... 详细信息
来源: 评论
An approximation algorithm for vehicle routing with compatibility constraints
收藏 引用
OPERATIONS RESEARCH LETTERS 2018年 第6期46卷 579-584页
作者: Yu, Miao Nagarajan, Viswanath Shen, Siqian Univ Michigan Dept Ind & Operat Engn Ann Arbor MI 48109 USA
We study a multiple-vehicle routing problem with a minimum makespan objective and compatibility constraints. We provide an approximation algorithm and a nearly-matching hardness of approximation result. We also provid... 详细信息
来源: 评论
An approximation algorithm for k-facility location problem with linear penalties using local search scheme
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2018年 第1期36卷 264-279页
作者: Wang, Yishui Xu, Dachuan Du, Donglei Wu, Chenchen Beijing Univ Technol Coll Appl Sci Dept Informat & Operat Res 100 Pingleyuan Beijing 100124 Peoples R China Univ New Brunswick Fac Business Adm Fredericton NB E3B 5A3 Canada Tianjin Univ Technol Coll Sci Tianjin 300384 Peoples R China
In this paper, we consider an extension of the classical facility location problem, namely k-facility location problem with linear penalties. In contrast to the classical facility location problem, this problem opens ... 详细信息
来源: 评论
An improved approximation algorithm for the discrete Frechet distance
收藏 引用
INFORMATION PROCESSING LETTERS 2018年 138卷 72-74页
作者: Chan, Timothy M. Rahmati, Zahed Univ Illinois Dept Comp Sci 201 N Goodwin Ave Urbana IL 61801 USA Amirkabir Univ Technol Dept Math & Comp Sci 424 Hafez Ave Tehran 158754413 Iran
For two sequences P and Q of n points in R-d, we compute an approximation to the discrete Frechet distance. Our f-approximation algorithm runs in time O(n logn + n(2)/f(2)), for any f is an element of[1, root n/log n]... 详细信息
来源: 评论
An approximation algorithm for a competitive facility location problem with network effects
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2018年 第1期267卷 176-186页
作者: Kung, Ling-Chieh Liao, Wei-Hung Natl Taiwan Univ Dept Informat Management Taipei 10617 Taiwan
When facilities are built to serve end consumers directly, it is natural that consumer demands are affected by the number of open facilities. Moreover, sometimes a facility becomes more attractive if other facilities ... 详细信息
来源: 评论
approximation algorithm for Minimum Weight Fault-Tolerant Virtual Backbone in Unit Disk Graphs
收藏 引用
IEEE-ACM TRANSACTIONS ON NETWORKING 2017年 第2期25卷 925-933页
作者: Shi, Yishuo Zhang, Zhao Mo, Yuchang Du, Ding-Zhu Xinjiang Univ Coll Math & Syst Sci Urumqi 830046 Peoples R China Zhejiang Normal Univ Coll Math Phys & Informat Engn Jinhua 321004 Peoples R China Univ Texas Dallas Dept Comp Sci Richardson TX 75080 USA
In a wireless sensor network, the virtual backbone plays an important role. Due to accidental damage or energy depletion, it is desirable that the virtual backbone is fault-tolerant. A fault-tolerant virtual backbone ... 详细信息
来源: 评论
Constant Factor approximation algorithm for l-Pseudoforest Deletion Problem  24th
Constant Factor Approximation Algorithm for <i>l</i>-Pseudof...
收藏 引用
24th International Computing and Combinatorics Conference (COCOON)
作者: Lin, Mugang Fu, Bin Feng, Qilong Cent S Univ Sch Informat Sci & Engn Changsha Hunan 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 component is at most l edges away from being a tree. The l-Pseudoforest Deletion problem is to delete a vertex set P of minimum weight from a given vertex-weighted ... 详细信息
来源: 评论