咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是91-100 订阅
排序:
A randomized approximation algorithm for metric triangle packing
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2021年 第1期41卷 12-27页
作者: Chen, Yong Chen, Zhi-Zhong Lin, Guohui Wang, Lusheng Zhang, An Hangzhou Dianzi Univ Dept Math Hangzhou Peoples R China Tokyo Denki Univ Div Informat Syst Design Saitama Japan Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China
Given an edge-weighted complete graph G on 3n vertices, the maximum-weight triangle packing problem asks for a collection of n vertex-disjoint triangles in G such that the total weight of edges in these n triangles is... 详细信息
来源: 评论
Deterministic approximation algorithm for submodular maximization subject to a matroid constraint
收藏 引用
INTERNATIONAL JOURNAL OF CARDIOLOGY 2021年 343卷 1-15页
作者: Sun, Xin Xu, Dachuan Guo, Longkun Li, Min Beijing Univ Technol Dept Operat Res & Informat Engn Beijing 100124 Peoples R China Qilu Univ Technol Shandong Comp Sci Ctr Sch Comp Sci & Technol Shandong Key Lab Comp NetworksShandong Acad Sci Jinan 250353 Peoples R China Fuzhou Univ Sch Comp & Data Sci Fuzhou 350116 Peoples R China Shandong Normal Univ Sch Math & Stat Jinan 250014 Peoples R China
In this paper, we study the generalized submodular maximization problem with a nonnegative monotone submodular set function as the objective function and subject to a matroid constraint. The problem is generalized thr... 详细信息
来源: 评论
AN approximation algorithm FOR FULLY PLANAR EDGE-DISJOINT PATHS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2021年 第2期35卷 752-769页
作者: Huang, Chien-Chung Mari, Mathieu Mathieu, Claire Schewior, Kevin Vygen, Jens Univ PSL Ecole Normale Super CNRS F-75005 Paris France Univ PSL Comp Sci Dept Ecole Normale Super F-75005 Paris France Univ Paris CNRS IRIF F-75205 Paris France Univ Cologne Dept Math Informat D-50931 Cologne Germany Univ Bonn Hausdorff Ctr Math Res Inst Discrete Math D-53113 Bonn Germany
We devise a constant-factor approximation algorithm for the maximization version of the edge-disjoint paths problem if the supply graph together with the demand edges forms a planar graph. By planar duality, this is e... 详细信息
来源: 评论
An approximation algorithm for Sharing-Aware Virtual Machine Revenue Maximization
收藏 引用
IEEE TRANSACTIONS ON SERVICES COMPUTING 2021年 第1期14卷 1-15页
作者: Rampersaud, Safraz Grosu, Daniel Wayne State Univ Dept Comp Sci 5057 Woodward Ave Detroit MI 48202 USA
Cloud providers face the challenge of efficiently managing their infrastructure through minimizing resource consumption while allocating service requests such that their revenue is maximized. Solutions addressing this... 详细信息
来源: 评论
Cutting path optimization for an automatic cutter in polynomial time using a 3/2 approximation algorithm
收藏 引用
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2021年 第11-12期113卷 3667-3679页
作者: Eapen, Neeta A. Heckendorn, Robert B. Natl Inst Technol Calicut Calicut Kerala India Univ Idaho Moscow ID 83843 USA
The optimal path to be followed by an automatic cutter to cut a set of shapes arranged on a material is termed as the cutting path determination problem. The shapes are often considered as polygons. Each polygon can b... 详细信息
来源: 评论
Minimizing the Installation Cost of Ground Stations in Satellite Networks: Complexity, Dynamic Programming and approximation algorithm
收藏 引用
IEEE WIRELESS COMMUNICATIONS LETTERS 2021年 第2期10卷 378-382页
作者: Efrem, Christos N. Panagopoulos, Athanasios D. Natl Tech Univ Athens Sch Elect & Comp Engn Athens 15780 Greece
In this letter, we study the optimum selection of ground stations (GSs) in RF/optical satellite networks (SatNets) in order to minimize the overall installation cost under an outage probability requirement, assuming i... 详细信息
来源: 评论
An approximation algorithm for k-Depot Split Delivery Vehicle Routing Problem
收藏 引用
INFORMS JOURNAL ON COMPUTING 2023年 第5期35卷 1179-1194页
作者: Lai, Xiaofan Xu, Liang Xu, Zhou Du, Yang Shenzhen Univ Inst Big Data Intelligent Management & Decis Coll Management Shenzhen 518055 Peoples R China Southwestern Univ Finance & Econ Sch Business Adm Chengdu 611130 Peoples R China Hong Kong Polytech Univ Dept Logist & Maritime Studies Hong Kong Peoples R China
A multidepot capacitated vehicle routing problem aims to serve customers' demands using a fleet of capacitated vehicles located in multiple depots, such that the total travel cost of the vehicles is minimized. We ... 详细信息
来源: 评论
An approximation algorithm for lower-bounded k-median with constant factor
收藏 引用
Science China(Information Sciences) 2022年 第4期65卷 93-101页
作者: Xiaoliang WU Feng SHI Yutian GUO Zhen ZHANG Junyu HUANG Jianxin WANG School of Computer Science and Engineering Central South University Hunan Provincial Key Lab on Bioinformatics Central South University School of Frontier Crossover Studies Hunan University of Technology and Business
The lower-bounded k-median problem plays a key role in many applications related to privacy protection, which requires that the amount of assigned client to each facility should not be less than the requirement. Unfor... 详细信息
来源: 评论
approximation algorithm for the Offloading Problem in Edge Computing  15th
Approximation Algorithm for the Offloading Problem in Edge C...
收藏 引用
15th International Conference on Wireless algorithms, Systems, and Applications (WASA)
作者: Han, Xinxin Gao, Guichen Ning, Li Wang, Yang Zhang, Yong Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen Peoples R China Univ Chinese Acad Sci Beijing Peoples R China
In the edge-cloud environment, offloading technique decides the task to be executed either at the cloud or at the edge. Offloading can improve the quality of service and the efficiency of the system. In most previous ... 详细信息
来源: 评论
A Tight approximation algorithm for the Cluster Vertex Deletion Problem  22nd
A Tight Approximation Algorithm for the Cluster Vertex Delet...
收藏 引用
22nd International Conference on Integer Programming and Combinatorial Optimization (IPCO)
作者: Aprile, Manuel Drescher, Matthew Fiorini, Samuel Huynh, Tony Univ Padua Dipartimento Matemat Padua Italy Univ Libre Bruxelles Dept Math Brussels Belgium Monash Univ Sch Math Melbourne Vic Australia
We give the first 2-approximation algorithm for the cluster vertex deletion problem. This is tight, since approximating the problem within any constant factor smaller than 2 is UGC-hard. Our algorithm combines the pre... 详细信息
来源: 评论