咨询与建议

限定检索结果

文献类型

  • 230 篇 期刊文献
  • 64 篇 会议
  • 2 篇 学位论文
  • 1 册 图书

馆藏范围

  • 297 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 208 篇 工学
    • 177 篇 计算机科学与技术...
    • 35 篇 软件工程
    • 21 篇 电气工程
    • 9 篇 信息与通信工程
    • 8 篇 交通运输工程
    • 5 篇 电子科学与技术(可...
    • 5 篇 控制科学与工程
    • 4 篇 机械工程
    • 3 篇 土木工程
    • 3 篇 生物医学工程(可授...
    • 2 篇 核科学与技术
    • 2 篇 生物工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 冶金工程
    • 1 篇 网络空间安全
  • 158 篇 理学
    • 146 篇 数学
    • 10 篇 生物学
    • 9 篇 统计学(可授理学、...
    • 4 篇 物理学
    • 2 篇 化学
  • 97 篇 管理学
    • 96 篇 管理科学与工程(可...
    • 9 篇 工商管理
  • 15 篇 经济学
    • 11 篇 应用经济学
    • 4 篇 理论经济学
  • 6 篇 法学
    • 4 篇 法学
    • 2 篇 社会学
  • 3 篇 军事学
  • 2 篇 教育学
    • 2 篇 心理学(可授教育学...
  • 2 篇 农学
  • 1 篇 医学
    • 1 篇 临床医学
    • 1 篇 特种医学

主题

  • 297 篇 exact algorithms
  • 20 篇 graph algorithms
  • 19 篇 heuristics
  • 18 篇 parameterized co...
  • 16 篇 combinatorial op...
  • 15 篇 approximation al...
  • 14 篇 parameterized al...
  • 14 篇 scheduling
  • 10 篇 vehicle routing
  • 9 篇 fixed-parameter ...
  • 9 篇 dynamic programm...
  • 8 篇 np-hardness
  • 8 篇 complexity
  • 7 篇 maximum satisfia...
  • 6 篇 traveling salesm...
  • 6 篇 metaheuristics
  • 6 篇 survey
  • 6 篇 dominating set
  • 6 篇 treewidth
  • 6 篇 steiner tree

机构

  • 8 篇 univ elect sci &...
  • 6 篇 univ bergen dept...
  • 6 篇 univ tubingen wi...
  • 5 篇 univ bologna dei...
  • 5 篇 lund univ dept c...
  • 5 篇 univ jena inst i...
  • 4 篇 univ utrecht ins...
  • 4 篇 maastricht univ ...
  • 4 篇 univ utrecht dep...
  • 4 篇 tu berlin inst s...
  • 3 篇 univ warsaw inst...
  • 3 篇 univ utrecht dep...
  • 3 篇 univ talca dept ...
  • 3 篇 univ bologna dei...
  • 3 篇 univ bergen dept...
  • 3 篇 nyu dept comp sc...
  • 3 篇 univ elect sci &...
  • 3 篇 univ warsaw wars...
  • 3 篇 lebanese amer un...
  • 3 篇 florida state un...

作者

  • 12 篇 bodlaender hans ...
  • 11 篇 niedermeier rolf
  • 10 篇 xiao mingyu
  • 8 篇 van rooij johan ...
  • 8 篇 niedermeier r
  • 7 篇 delorme maxence
  • 6 篇 nederlof jesper
  • 6 篇 vigo daniele
  • 6 篇 fomin fedor v.
  • 5 篇 guo j
  • 5 篇 kratsch dieter
  • 5 篇 monaci michele
  • 5 篇 liedloff mathieu
  • 5 篇 gramm j
  • 5 篇 bredereck robert
  • 4 篇 pilipczuk marcin
  • 4 篇 iori manuel
  • 4 篇 sorge manuel
  • 4 篇 chen jiehua
  • 4 篇 nagamochi hirosh...

语言

  • 274 篇 英文
  • 23 篇 其他
检索条件"主题词=Exact Algorithms"
297 条 记 录,以下是161-170 订阅
排序:
MINIMUM DOMINATING SET OF QUEENS: A trivial programming exercise?
收藏 引用
DISCRETE APPLIED MATHEMATICS 2010年 第4期158卷 308-318页
作者: Fernau, Henning Univ Trier FB Abt Informat 4 D-54286 Trier Germany
MINIMUM DOMINATING SET OF QUEENS is one of the typical programming exercises of a first year's computer science course. However, little work has been published on the complexity of this problem. We analyse here se... 详细信息
来源: 评论
Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
收藏 引用
MATHEMATICAL BIOSCIENCES AND ENGINEERING 2022年 第11期19卷 10731-10740页
作者: Li, Shuguang Shandong Technol & Business Univ Sch Comp Sci & Technol Yantai 264005 Peoples R China
We consider the problem of scheduling jobs with equal lengths on uniform parallel batch machines with non-identical capacities where each job can only be processed on a specified subset of machines called its processi... 详细信息
来源: 评论
DETECTING AND COUNTING SMALL PATTERN GRAPHS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2015年 第3期29卷 1322-1339页
作者: Floderus, Peter Kowaluk, Miroslaw Lingas, Andrzej Lundell, Eva-Marta Lund Univ Ctr Math Sci S-22100 Lund Sweden Warsaw Univ Inst Informat Warsaw Poland Lund Univ Dept Comp Sci S-22100 Lund Sweden
We study the induced subgraph isomorphism problem and the general subgraph isomorphism problem for small pattern graphs. We present a new general method for detecting induced subgraphs of a host graph isomorphic to a ... 详细信息
来源: 评论
Optimal interval scheduling with nonidentical given machines
收藏 引用
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2019年 第3期22卷 1007-1015页
作者: Zhou, Haohao Bai, Guanghan Deng, Su Natl Univ Def Technol Sci & Technol Informat Syst Engn Lab Changsha Hunan Peoples R China Natl Univ Def Technol Lab Sci & Technol Integrated Logist Support Changsha Hunan Peoples R China
We consider an interval scheduling problem where n jobs are required to be carried out by m nonidentical machines in an offline-scheduling way. Each job has a starting time, a finishing time and a number of processing... 详细信息
来源: 评论
exact algorithm for matrix-based project planning problems
收藏 引用
EXPERT SYSTEMS WITH APPLICATIONS 2015年 第9期42卷 4460-4473页
作者: Kosztyan, Zsolt T. Univ Pannonia Dept Quantitat Methods Veszprem Hungary
This paper proposes a new matrix-based project planning method that takes into consideration task importance or probability of completions thus determines and ranks the importance or probability of possible project sc... 详细信息
来源: 评论
Efficiency in exponential time for domination-type problems
收藏 引用
DISCRETE APPLIED MATHEMATICS 2008年 第17期156卷 3291-3297页
作者: Schiermeyer, Ingo TU Bergakad Freiberg Inst Diskrete Math & Algebra D-09596 Freiberg Germany
We design fast exponential time algorithms for some intractable graph-theoretic problems. Our main result states that a minimum optional dominating set in a graph of order n can be found in time 0* (1.8899(n)). Our me... 详细信息
来源: 评论
Minimum tiling of a rectangle by squares
收藏 引用
ANNALS OF OPERATIONS RESEARCH 2018年 第2期271卷 831-851页
作者: Monaci, Michele dos Santos, Andre Gustavo Univ Bologna DEI Viale Risorgimento 2 I-40136 Bologna Italy Univ Fed Vicosa DPI Ave PH Rolfs S-N BR-36570900 Vicosa MG Brazil
We consider a two-dimensional problem in which one is required to split a given rectangular bin into the smallest number of items. The resulting items must be squares to be packed, without overlapping, into the bin so... 详细信息
来源: 评论
Extending Lifetime Through Partial Coverage And Roles Allocation in Connectivity-Constrained Sensor Networks
收藏 引用
IFAC-PapersOnLine 2016年 第12期49卷 973-978页
作者: Carrabs, Francesco Cerulli, Raffaele D'Ambrosio, Ciriaco Raiconi, Andrea Department of Mathematics University of Salerno Via Giovanni Paolo II 132 Fisciano84084 Italy
We consider a scenario in which certain target locations are monitored through sensors, which are scattered all over a considered area. A quality-of-service threshold imposes that, at any given time, a predefined perc... 详细信息
来源: 评论
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds
收藏 引用
ACM TRANSACTIONS ON COMPUTATION THEORY 2021年 第2期13卷 1-25页
作者: Fomin, Fedor, V Lokshtanov, Daniel Mihajlin, Ivan Saurabh, Saket Zehavi, Meirav Univ Bergen Thormohlensgate St Bergen Norway Univ Calif Santa Barbara Univ Rd St Santa Barbara CA 93106 USA Univ Calif San Diego Alcala Part St San Diego CA 92103 USA HBNI Inst Math Sci Cross St Chennai Tamil Nadu India Ben Gurion Univ Negev Ben Gurion St Beer Sheva Israel
We prove that the Hadwiger number of an n-vertex graph G (the maximum size of a clique minor in G) cannot be computed in time n(o(n)), unless the Exponential Time Hypothesis (ETH) fails. This resolves a well-known ope... 详细信息
来源: 评论
Minimum cost edge blocker clique problem
收藏 引用
ANNALS OF OPERATIONS RESEARCH 2020年 第1-2期294卷 345-376页
作者: Pajouh, Foad Mahdavi Univ Massachusetts Dept Management Sci & Informat Syst Boston MA 02125 USA
Given a graph with weights on its vertices and blocking costs on its edges, and a user-defined threshold tau 0 the minimum cost edge blocker clique problem (EBCP) is introduced as the problem of blocking a minimum cos... 详细信息
来源: 评论