咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 3,225 篇 approximation al...
  • 222 篇 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,996 篇 英文
  • 216 篇 其他
  • 13 篇 中文
  • 3 篇 法文
  • 2 篇 德文
检索条件"主题词=Approximation Algorithm"
3225 条 记 录,以下是141-150 订阅
排序:
PENGRAV: a practical polynomial time algorithm for optimizing the engraving path of an automatic engraving machine using a 3/2 approximation algorithm
收藏 引用
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2022年 第5-6期123卷 1721-1732页
作者: Eapen, Neeta A. Heckendorn, Robert B. Univ Idaho Dept Comp Sci Moscow ID 83844 USA
Automatic engraving machines have several industrial applications, such as nameplates, identification codes, and bar code engraving. It can also be used for engraving messages or pictures on decorative items in homes.... 详细信息
来源: 评论
A Connectivity-Aware approximation algorithm for Relay Node Placement in Wireless Sensor Networks
收藏 引用
IEEE SENSORS JOURNAL 2016年 第2期16卷 515-528页
作者: Ma, Chaofan Liang, Wei Zheng, Meng Sharif, Hamid Chinese Acad Sci Key Lab Networked Control Syst Shenyang 110016 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China Univ Nebraska Dept Comp & Elect Engn Omaha NE 68182 USA
In two-tiered wireless sensor networks (WSNs), relay node placement is one of the key factors impacting the network energy consumption and the system overhead. In this paper, a novel connectivity-aware approximation a... 详细信息
来源: 评论
An approximation algorithm for minimum certificate dispersal problems
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2006年 第2期E89A卷 551-558页
作者: Zheng, H Omura, S Wada, K Nagoya Inst Technol Grad Sch Engn Dept Comp Sci & Engn Nagoya Aichi 4668555 Japan
We consider a network, where a special data called certificate is issued between two users, and all certificates issued by the users in the network can be represented by a directed graph. For any two users u and v, wh... 详细信息
来源: 评论
A constant factor approximation algorithm for boxicity of circular arc graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2014年 178卷 1-18页
作者: Adiga, Abhijin Babu, Jasine Chandran, L. Sunil Virginia Tech Virginia Bioinformat Inst Network Dynam & Simulat Sci Lab Blacksburg VA 24061 USA Indian Inst Sci Dept Comp Sci & Automat Bangalore 560012 Karnataka India
The boxicity (resp. cubicity) of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (resp. cubes) in R-k. Equivalently, it is the minimum number of... 详细信息
来源: 评论
A simple greedy approximation algorithm for the minimum connected -Center problem
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2016年 第4期31卷 1417-1429页
作者: Liang, Dongyue Mei, Liquan Willson, James Wang, Wei Xi An Jiao Tong Univ Sch Math & Stat Xian 710049 Peoples R China Univ Texas Dallas Dept Comp Sci Richardson TX 75080 USA
In this paper, we consider the connected -Center () problem, which can be seen as the classic -Center problem with the constraint of internal connectedness, i.e., two nodes in a cluster are required to be connected by... 详细信息
来源: 评论
A 3/4-approximation algorithm for multiple subset sum
收藏 引用
JOURNAL OF HEURISTICS 2003年 第2期9卷 99-111页
作者: Caprara, A Kellerer, H Pferschy, U Univ Bologna DEIS I-40136 Bologna Italy Graz Univ Dept Stat & Operat Res A-8010 Graz Austria
The Multiple Subset Sum Problem (MSSP) is the variant of bin packing in which the number of bins is given and one would like to maximize the overall weight of the items packed in the bins. The problem is also a specia... 详细信息
来源: 评论
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates
收藏 引用
DISCRETE APPLIED MATHEMATICS 2001年 第1-3期114卷 255-271页
作者: Kashyrskikh, KN Potts, CN Sevastianov, SV Sobolev Inst Math Novosibirsk 630090 Russia Univ Southampton Fac Math Sci Southampton S017 1BJ Hants England Novosibirsk State Univ Novosibirsk 630090 Russia
The two-machine flow-shop sequencing problem with arbitrary release dates of jobs and the minimum makespan criterion is considered. The problem is known to be NP-hard, and the best-known approximation algorithms are t... 详细信息
来源: 评论
An approximation algorithm for P-prize-collecting Set Cover Problem
收藏 引用
Journal of the Operations Research Society of China 2023年 第1期11卷 207-217页
作者: Jin-Shuang Guo Wen Liu Bo Hou School of Mathematical Sciences Hebei Key Laboratory of Computational Mathematics and ApplicationsHebei Normal UniversityShijiazhuang050024HebeiChina
In this paper,we consider the P-prize-collecting set cover(P-PCSC)problem,which is a generalization of the set cover *** this problem,we are given a set system(U,S),where U is a ground set and S⊆2U is a collection of ... 详细信息
来源: 评论
When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex k-center problem
收藏 引用
JOURNAL OF HEURISTICS 2017年 第5期23卷 349-366页
作者: Garcia-Diaz, Jesus Sanchez-Hernandez, Jairo Menchaca-Mendez, Ricardo Menchaca-Mendez, Rolando Inst Politecn Nacl Ctr Invest Comp Unidad Profes Adolfo Lopez Mateos Av Luis Enrique Erro S-N Mexico City DF Mexico
The vertex k-center selection problem is a well known NP-Hard minimization problem that can not be solved in polynomial time within a p < 2 approximation factor, unless P = NP . Even though there are algorithms tha... 详细信息
来源: 评论
A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2013年 第2期25卷 265-278页
作者: Viet Hung Nguyen Univ Paris 06 LIP6 Paris France
We present a primal-dual aOElog(n)aOE parts per thousand-approximation algorithm for the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visit... 详细信息
来源: 评论