咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 2,358 篇 工学
    • 2,018 篇 计算机科学与技术...
    • 487 篇 电气工程
    • 391 篇 信息与通信工程
    • 337 篇 软件工程
    • 77 篇 机械工程
    • 75 篇 控制科学与工程
    • 68 篇 电子科学与技术(可...
    • 29 篇 交通运输工程
    • 28 篇 仪器科学与技术
    • 11 篇 材料科学与工程(可...
    • 8 篇 土木工程
    • 6 篇 力学(可授工学、理...
    • 6 篇 测绘科学与技术
    • 6 篇 石油与天然气工程
    • 6 篇 生物工程
    • 3 篇 环境科学与工程(可...
  • 1,662 篇 理学
    • 1,609 篇 数学
    • 28 篇 生物学
    • 25 篇 统计学(可授理学、...
    • 18 篇 物理学
    • 12 篇 系统科学
    • 10 篇 化学
    • 3 篇 地球物理学
  • 897 篇 管理学
    • 890 篇 管理科学与工程(可...
    • 235 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 242 篇 经济学
    • 235 篇 应用经济学
    • 6 篇 理论经济学
  • 10 篇 法学
    • 8 篇 法学
  • 9 篇 医学
    • 5 篇 临床医学
  • 8 篇 军事学
  • 4 篇 农学
  • 2 篇 艺术学
  • 1 篇 教育学

主题

  • 3,239 篇 approximation al...
  • 224 篇 scheduling
  • 81 篇 combinatorial op...
  • 73 篇 approximation al...
  • 69 篇 np-hard
  • 68 篇 computational co...
  • 65 篇 np-hardness
  • 64 篇 linear programmi...
  • 61 篇 np-complete
  • 56 篇 optimization
  • 53 篇 facility locatio...
  • 52 篇 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...
  • 49 篇 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
  • 48 篇 lin guohui
  • 45 篇 zhang zhao
  • 44 篇 wu chenchen
  • 42 篇 li deying
  • 34 篇 zhang dongmei
  • 30 篇 li min
  • 30 篇 chen yong
  • 30 篇 du ding-zhu
  • 29 篇 zhang an
  • 28 篇 yu wei
  • 26 篇 liu zhaohui
  • 26 篇 li weidong
  • 25 篇 dai haipeng
  • 25 篇 wang wei
  • 25 篇 zhang peng
  • 25 篇 chen guihai
  • 24 篇 dumitrescu adria...

语言

  • 2,999 篇 英文
  • 226 篇 其他
  • 13 篇 中文
  • 2 篇 法文
  • 1 篇 德文
检索条件"主题词=Approximation algorithm"
3239 条 记 录,以下是3031-3040 订阅
排序:
A VECTORIZATION SCHEME FOR NONCONVEX SET OPTIMIZATION PROBLEMS
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2022年 第2期32卷 1184-1209页
作者: Eichfelder, Gabriele Quintana, Ernest Rocktaschel, Stefan Tech Univ Ilmenau Inst Math Po 10 05 65 D-98684 Ilmenau Germany
In this paper, we study a solution approach for set optimization problems with respect to the lower set less relation. This approach can serve as a base for numerically solving set optimization problems by using estab... 详细信息
来源: 评论
Approximability of the minimum maximal matching problem in planar graphs
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2003年 第12期E86A卷 3251-3258页
作者: Nagamochi, H Nishida, Y Ibaraki, T Toyohashi Univ Technol Dept Informat & Comp Sci Toyohashi Aichi 4418580 Japan Japan Res Inst Ltd Osaka 5500013 Japan Kyoto Univ Fac Informat Dept Appl Math & Phys Kyoto 6068501 Japan
Given an edge-weighted graph G, the minimum maximal matching problem asks to find a minimum weight maximal matching. The problem is known to be NP-hard even if the graph is planar and unweighted. In this paper, we con... 详细信息
来源: 评论
Secure connected domination and secure total domination in unit disk graphs and rectangle graphs ✩
收藏 引用
THEORETICAL COMPUTER SCIENCE 2023年 第1期957卷
作者: Wang, Cai-Xia Yang, Yu Xu, Shou-Jun Lanzhou Univ Gansu Ctr Appl Math Sch Math & Stat Lanzhou 730000 Gansu Peoples R China
Given a graph G with vertex set V, a secure connected (resp. total) dominating set of G is a connected (resp. total) dominating set S c V with the property that for each u e V \ S, there exists v e S adjacent to u suc... 详细信息
来源: 评论
Efficient algorithms for Stochastic Ride-Pooling Assignment with Mixed Fleets
收藏 引用
TRANSPORTATION SCIENCE 2023年 第4期57卷 908-936页
作者: Luo, Qi Nagarajan, Viswanath Sundt, Alexander Yin, Yafeng Vincent, John Shahabi, Mehrdad Clemson Univ Dept Ind Engn Clemson SC 29634 USA Univ Michigan Dept Ind & Operat Engn Ann Arbor MI 48109 USA Univ Michigan Dept Civil & Environm Engn Ann Arbor MI 48109 USA Ford Motor Co Dearborn MI 48120 USA
Ride-pooling, which accommodates multiple passenger requests in a single trip, has the potential to substantially enhance the throughput of mobility-on-demand (MoD) systems. This paper investigates MoD systems that op... 详细信息
来源: 评论
Inapproximability of the edge-contraction problem
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2006年 第5期E89A卷 1425-1427页
作者: Otsuki, Hideaki Hirata, Tomio Nanzan Univ Dept Informat & Telecommunicate Engn Seto 4890863 Japan Nagoya Univ Grad Sch Engn Nagoya Aichi 4648603 Japan
For a property pi on graphs, the edge-contraction problem with respect to pi is defined as a problem of finding a set of edges of minimum cardinality whose contraction results in a graph satisfying the property pi. Th... 详细信息
来源: 评论
Implementing synchronous reactive components upon multiprocessor platforms
收藏 引用
JOURNAL OF SYSTEMS ARCHITECTURE 2021年 116卷 102027-102027页
作者: Baruah, Sanjoy Washington Univ St Louis MO 63110 USA
Model-based design methodologies based on the synchrony assumption are widely used in many safety-critical application domains. The synchrony assumption asserts that actions (such as the execution of code) occur insta... 详细信息
来源: 评论
New algorithms for a simple measure of network partitioning
收藏 引用
THEORETICAL COMPUTER SCIENCE 2023年 第1期957卷
作者: Zhao, Xueyang Yan, Binghao Zhang, Peng Shandong Univ Sch Software Jinan 250101 Shandong Peoples R China
Partitioning a network into k pieces is a fundamental problem in network science. A simple measure of partitioning a network is provided by the Max k-Uncut problem. Given an nvertex undirected graph G with nonnegative... 详细信息
来源: 评论
Optimal algorithm for min-max line barrier coverage with mobile sensors on 2-dimensional plane
收藏 引用
COMPUTER NETWORKS 2023年 第1期228卷
作者: Yao, Pei Guo, Longkun Li, Peng Lin, Jiawei Anhui Normal Univ Coll Math & Stat Wuhu 241002 Peoples R China Qilu Univ Technol Sch Comp Sci Jinan 250301 Peoples R China Fuzhou Univ Sch Math & Stat Fuzhou 360116 Peoples R China Google LLC Kirkland WA USA Fuzhou Univ Coll Comp & Data Sci Coll Software Fuzhou 360116 Peoples R China
Emerging IoT applications impose line barrier coverage (LBC) tasks with min-max movement objective due to requirements of energy balance, fairness, etc. In LBC, we are given a line barrier and a set of n sensors distr... 详细信息
来源: 评论
Multitasking scheduling with alternate periods
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2023年 第3期45卷 92-92页
作者: Huo, Yujia Miao, Cuixia Kong, Fanyu Zhang, Yuzhong Qufu Normal Univ Sch Math Sci Qufu 273165 Shandong Peoples R China Qufu Normal Univ Inst Operat Res Rizhao 276826 Shandong Peoples R China
In this paper, we consider the multitasking scheduling with alternate odd-period and even-period. For the minimization of makespan on one single machine, we present a 2-approximation algorithm for the general case and... 详细信息
来源: 评论
NORA: An Approach for Transforming Network Management Policies into Automated Planning Problems
收藏 引用
SENSORS 2021年 第5期21卷 1790-1790页
作者: Rodriguez-Vivas, Angela Caicedo, Oscar Mauricio Ordonez, Armando Nobre, Jeferson Campos Granville, Lisandro Zambenedetti Univ Cauca Dept Telemat Popayan 190002 Colombia Univ Fed Rio Grande do Sul Inst Informat BR-90040060 Porto Alegre RS Brazil
Realizing autonomic management control loops is pivotal for achieving self-driving networks. Some studies have recently evidence the feasibility of using Automated Planning (AP) to carry out these loops. However, in p... 详细信息
来源: 评论