咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是351-360 订阅
An Improved Rational approximation of Bark Scale Using Low Complexity and Low Delay Filter Banks
收藏 引用
CIRCUITS SYSTEMS AND SIGNAL PROCESSING 2024年 第9期43卷 5591-5623页
作者: Hareesh, V. Bindiya, T. S. Natl Inst Technol Dept Elect & Commun Engn Calicut 673601 Kerala India
This paper proposes an algorithm to obtain the sampling factors to model any frequency partitioning so that it is realized using low complexity rational decimated non-uniform filter banks (RDNUFBs). The proposed algor... 详细信息
来源: 评论
Improved approximation algorithms for Bin Packing with Conflicts
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2023年 第0期
作者: Huang, Zhihua Zhang, An Dosa, Gyorgy Chen, Yong Xiong, Chenling Hangzhou Dianzi Univ Dept Math Hangzhou 310018 Peoples R China Pannon Univ Egyet Str 10 H-8200 Veszprem Hungary
Given a set of items, and a conflict graph defined on the item set, the problem of bin packing with conflicts asks for a partition of items into a minimum number of independent sets so that the total size of items in ... 详细信息
来源: 评论
approximation algorithms for the Lower-Bounded k-Median and Its Generalizations  26th
Approximation Algorithms for the Lower-Bounded k-Median and ...
收藏 引用
26th International Computing and Combinatorics Conference (COCOON)
作者: Han, Lu Hao, Chunlin Wu, Chenchen Zhang, Zhenning Chinese Acad Sci Acad Math & Syst Sci Beijing 100190 Peoples R China Beijing Univ Technol Dept Operat Res & Informat Engn Beijing 100124 Peoples R China Tianjin Univ Technol Coll Sci Tianjin 300384 Peoples R China
In this paper, we consider the lower-bounded k-median problem (LB k-median) that extends the classical k-median problem. In the LB k-median, a set of facilities, a set of clients and an integer k are given. Every faci... 详细信息
来源: 评论
Hardness results and approximation algorithm for total liar's domination in graphs
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2014年 第4期27卷 643-662页
作者: Panda, B. S. Paul, S. Indian Inst Technol Delhi Dept Math Comp Sci & Applicat Grp New Delhi 110016 India
In this paper, we initiate the study of total liar's domination of a graph. A subset LaS dagger V of a graph G=(V,E) is called a total liar's dominating set of G if (i) for all vaV, |N (G) (v)a (c) L|a parts p... 详细信息
来源: 评论
An approximation algorithm for the Dynamic Facility Location Problem with Submodular Penalties
收藏 引用
Acta Mathematicae Applicatae Sinica 2014年 第1期30卷 187-192页
作者: Chun-yan JIANG Gai-di LI Zhen WANG Basic Courses Teaching Department The Armed Police Academy Department of Applied Mathematics Beijing University of Technology
In this paper, we study the dynamic facility location problem with submodular penalties (DFLPSP). We present a combinatorial primal-dual 3-approximation algorithm for the DFLPSP.
来源: 评论
An Iterative Rounding 2-approximation algorithm for the k-partial Vertex Cover Problem
收藏 引用
Acta Mathematicae Applicatae Sinica 2014年 第2期30卷 271-278页
作者: Jian-hua TU Jun-feng DU Feng-mei YANG School of Science Beijing University of Chemical Technology
We study a generalization of the vertex cover problem. For a given graph with weights on the vertices and an integer k, we aim to find a subset of the vertices with minimum total weight, so that at least k edges in th... 详细信息
来源: 评论
Improved approximation algorithms for Matroid and Knapsack Means Problems
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2023年 第0期
作者: Zhao, Ao Zhou, Yang Liu, Qian Shandong Normal Univ Sch Math & Stat Jinan 250014 Peoples R China
Both matroid means and knapsack means are variations of the classic k-means problem in which we replace the cardinality constraint by matroid constraint or knapsack constraint respectively. In this paper, we give a 64... 详细信息
来源: 评论
approximation algorithms for General Cluster Routing Problem  26th
Approximation Algorithms for General Cluster Routing Problem
收藏 引用
26th International Computing and Combinatorics Conference (COCOON)
作者: Zhang, Xiaoyan Du, Donglei Gutin, Gregory Ming, Qiaoxia Sun, Jian Nanjing Normal Univ Sch Math Sci Nanjing 210023 Jiangsu Peoples R China Nanjing Normal Univ Inst Math Nanjing 210023 Jiangsu Peoples R China Univ New Brunswick Fac Management Fredericton NB E3B 5A3 Canada Univ London Egham Dept Comp Sci Royal Holloway Egham TW20 0EX Surrey England
Graph routing problems have been investigated extensively in operations research, computer science and engineering due to their ubiquity and vast applications. In this paper, we study constant approximation algorithms... 详细信息
来源: 评论
A 25/17-approximation algorithm for the Stable Marriage Problem with One-Sided Ties
收藏 引用
algorithmICA 2014年 第3期68卷 758-775页
作者: Iwama, Kazuo Miyazaki, Shuichi Yanagisawa, Hiroki Kyoto Univ Grad Sch Informat Sakyo Ku Kyoto 6068501 Japan Kyoto Univ Acad Ctr Comp & Media Studies Sakyo Ku Kyoto 6068501 Japan IBM Res Tokyo Koto Ku Tokyo 1358511 Japan
The problem of finding a largest stable matching where preference lists may include ties and unacceptable partners (MAX SMTI) is known to be NP-hard. It cannot be approximated within 33/29 (> 1.1379) unless P=NP, a... 详细信息
来源: 评论
An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2014年 第C期543卷 46-51页
作者: Li, Kenli Liu, Chubo Li, Keqin Hunan Univ Coll Informat Sci & Engn Natl Supercomp Ctr Changsha Changsha 410082 Hunan Peoples R China SUNY Coll New Paltz Dept Comp Sci New Paltz NY 12561 USA
We consider the scheduling of simple linear deteriorating jobs on parallel machines from a new perspective based on game theory. In scheduling, jobs are often controlled by independent and selfish agents, in which eac... 详细信息
来源: 评论