咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是3171-3180 订阅
排序:
An algorithm for Searching a Connected Dominating Set with Minimum Total-Edge-Weight in a Graph
An Algorithm for Searching a Connected Dominating Set with M...
收藏 引用
The second International Conference of Electrical and Electronics Engineering(ICEEE 2011)
作者: Shi Lei-yu Peng Jing Wang Yong School of Electronic Science and Engineering National University of Defense Technology
A new mathematical problem, namely searching a connected dominating set(CDS) with the minimum total edge weight in an edge-weighted graph which can provide a better mathematical model for wireless networks, has been b... 详细信息
来源: 评论
Preemptive scheduling with job-dependent setup times  99
Preemptive scheduling with job-dependent setup times
收藏 引用
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
作者: Petra Schuurman Gerhard J. Woeginger Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands Institut für Mathematik TU Graz Steyrergwe 30 A-8010 Graz Austria
来源: 评论
Cost Effective Mobile and Static Road Side Unit Deployment for Vehicular Adhoc Networks
Cost Effective Mobile and Static Road Side Unit Deployment f...
收藏 引用
International Conference on Computing, Networking and Communications
作者: Donghyun Kim Yesenia Velasco Zishen Yang Wei Wang Rasheed Hussain R. N. Uma Department of Mathematics and Physics North Carolina Central University School of Math. and Statistics Xi'an Jiaotong Univ. Department of Computer Science Innopolis University
This paper investigates a new strategy to best deploy road side units so that their spatio-temporal coverage is maximized under a limited budget. For the first time in the literature, we consider three different RSU d... 详细信息
来源: 评论
Python-based Optimization Model and algorithm for Rescue Routes During Gas Leak Emergencies
Python-based Optimization Model and Algorithm for Rescue Rou...
收藏 引用
第三十二届中国控制会议
作者: Wen-mei GAI Yun-feng DENG Jing LI Yan DU School of Civil and Environmental Engineering University of Science and Technology Beijing Chinese Academy of Governance Institute of Public Safety China Academy of science and Technology School of Civil and Environmental Engineering University of Science and Technology Beijing
Based on the theories and methods of operations research,a mathematical model for the short est rescue route during gas leak emergencies in high-sulfur oil and gas fields is built in this pap er,which contains two wei... 详细信息
来源: 评论
A New Bound for the Path Cover Problem
A New Bound for the Path Cover Problem
收藏 引用
2014全国理论计算机科学学术年会
作者: Xingfu Li Daming Zhu School of Computer Science and Technology Shandong UniversityJinanShandong 250100China
We consider the path cover problem which is to find a set of vertex-disjoint paths for a simple undirectedgraph with maximum number of edges to cover all vertices of this *** path cover problem isNP-hard because the w... 详细信息
来源: 评论
HEURISTICS FOR THE TRANSPOSITION DISTANCE PROBLEM
收藏 引用
JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY 2013年 第5期11卷 1350013-1350013页
作者: Dias, Ulisses Dias, Zanoni Univ Estadual Campinas Inst Comp BR-13083852 Campinas SP Brazil
Transpositions are large-scale mutational events that occur when a block of genes moves from a region of a chromosome to another region within the same chromosome. The transposition distance problem is the minimum num... 详细信息
来源: 评论
Link Scheduling in Wireless Cooperative Communication Networks
Link Scheduling in Wireless Cooperative Communication Networ...
收藏 引用
IEEE International Conference on Mobile Ad Hoc and Sensor Systems
作者: Chenxi Qiu Haiying Shen Department of Electrical and Computer Engineering Clemson University
In this paper, we study the link scheduling problem in wireless cooperative communication networks, in which receivers are allowed to combine copies of a message from different senders to combat fading. We formulate a... 详细信息
来源: 评论
Complex-Demand Knapsack Problems and Incentives in AC Power Systems  13
Complex-Demand Knapsack Problems and Incentives in AC Power ...
收藏 引用
International Conference on Autonomous Agents and Multiagent Systems
作者: Lan Yu Chi-Kin Chau Nanyang Technological University Singapore Singapore Masdar Institute of Science and Technology Abu Dhabi Uae
We consider AC electrical systems where each electrical device has a power demand expressed as a complex number, and there is a limit on the magnitude of total power supply. Motivated by this scenario, we introduce th... 详细信息
来源: 评论
An O(n3) algorithm for sorting signed genomes by reversals, transpositions, transreversals and block-interchanges
收藏 引用
JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY 2016年 第1期14卷 1640002-1640002页
作者: Yu, Shuzhi Hao, Fanchang Leong, Hon Wai Natl Univ Singapore Dept Comp Sci 13 Comp Dr Singapore 117417 Singapore Shandong Univ Polit Sci & Law Sch Informat Jinan 250014 Shandong Peoples R China Shandong Univ Polit Sci & Law Key Lab Evidence Identifying Univ Shandong Jinan 250014 Shandong Peoples R China
We consider the problem of sorting signed permutations by reversals, transpositions, transreversals, and block-interchanges. The problem arises in the study of species evolution via large-scale genome rearrangement op... 详细信息
来源: 评论
Clustering for Metric and Nonmetric Distance Measures
收藏 引用
ACM TRANSACTIONS ON algorithmS 2010年 第4期6卷 1–26页
作者: Ackermann, Marcel R. Bloemer, Johannes Sohler, Christian Univ Paderborn Dept Comp Sci D-33095 Paderborn Germany Tech Univ Dept Comp Sci D-44221 Dortmund Germany
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such that the sum of errors D(P, C) = Sigma... 详细信息
来源: 评论