咨询与建议

限定检索结果

文献类型

  • 11 篇 期刊文献
  • 5 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 14 篇 工学
    • 12 篇 计算机科学与技术...
    • 2 篇 软件工程
    • 1 篇 生物工程
  • 7 篇 理学
    • 6 篇 数学
    • 1 篇 生物学
  • 1 篇 经济学
    • 1 篇 应用经济学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...
    • 1 篇 工商管理

主题

  • 16 篇 fixed-parameter ...
  • 3 篇 h-minor-free gra...
  • 3 篇 degenerated grap...
  • 3 篇 dominating set p...
  • 2 篇 feedback vertex ...
  • 2 篇 multi-mode lot-s...
  • 2 篇 n-mixing set
  • 2 篇 finding an induc...
  • 2 篇 piecewise concav...
  • 2 篇 multi-module cap...
  • 2 篇 two-echelon capa...
  • 2 篇 polynomial kerne...
  • 2 篇 parameterized co...
  • 1 篇 np-hard problems
  • 1 篇 matroids
  • 1 篇 euclidean tsp
  • 1 篇 max-cut
  • 1 篇 rna sequence des...
  • 1 篇 (integral)homolo...
  • 1 篇 discrete algorit...

机构

  • 3 篇 tel aviv univ sc...
  • 2 篇 tel aviv univ sc...
  • 2 篇 inst math sci ma...
  • 1 篇 univ vienna dept...
  • 1 篇 tu wien austria
  • 1 篇 cnrs lamsade
  • 1 篇 grado department...
  • 1 篇 univ sydney nsw ...
  • 1 篇 iit hyderabad de...
  • 1 篇 chennai math ins...
  • 1 篇 univ salerno fis...
  • 1 篇 czech tech univ ...
  • 1 篇 univ sheffield s...
  • 1 篇 inria sophia ant...
  • 1 篇 max planck inst ...
  • 1 篇 inst math sci ch...
  • 1 篇 johannes kepler ...
  • 1 篇 inst math sci4 c...
  • 1 篇 cnrs lirmm montp...
  • 1 篇 univ siegen sieg...

作者

  • 5 篇 philip geevarghe...
  • 4 篇 saurabh saket
  • 3 篇 gutner shai
  • 2 篇 raman venkatesh
  • 2 篇 alon noga
  • 2 篇 misra neeldhara
  • 1 篇 mnich matthias
  • 1 篇 ordyniak sebasti...
  • 1 篇 meeks kitty
  • 1 篇 ponty yann
  • 1 篇 rastegari bahara...
  • 1 篇 will sebastian
  • 1 篇 kisfaludi-bak sa...
  • 1 篇 paul christophe
  • 1 篇 panolan fahad
  • 1 篇 golovach petr a.
  • 1 篇 maria clement
  • 1 篇 gargano luisa
  • 1 篇 kim eun jung
  • 1 篇 spreer jonathan

语言

  • 16 篇 英文
检索条件"主题词=fixed-parameter tractable algorithms"
16 条 记 录,以下是1-10 订阅
排序:
Euclidean TSP in Narrow Strips
收藏 引用
DISCRETE & COMPUTATIONAL GEOMETRY 2024年 第4期71卷 1456-1506页
作者: Alkema, Henk de Berg, Mark van der Hofstad, Remco Kisfaludi-Bak, Sandor TU Eindhoven Dept Math & Comp Sci Eindhoven Netherlands Aalto Univ Espoo Finland
We investigate how the complexity of Euclidean TSP for point sets P inside the strip (-infinity,+infinity)x[0,delta] depends on the strip width delta . - We obtain two main *** the case where the points have distinct ... 详细信息
来源: 评论
Infrared: a declarative tree decomposition-powered framework for bioinformatics
收藏 引用
algorithms FOR MOLECULAR BIOLOGY 2024年 第1期19卷 13页
作者: Yao, Hua-Ting Marchand, Bertrand Berkemer, Sarah J. Ponty, Yann Will, Sebastian Ecole Polytech CNRS Inst Polytech Paris LIXUMR 7161 Palaiseau France Univ Vienna Dept Theoret Chem Vienna Austria McGill Univ Sch Comp Sci Montreal PQ Canada Tokyo Inst Technol Earth Life Sci Inst Tokyo Japan
MotivationMany bioinformatics problems can be approached as optimization or controlled sampling tasks, and solved exactly and efficiently using Dynamic Programming (DP). However, such exact methods are typically tailo... 详细信息
来源: 评论
Exact algorithms for multi-module capacitated lot-sizing problem, and its generalizations with two-echelons and piecewise concave production costs
收藏 引用
IISE TRANSACTIONS 2023年 第12期55卷 1187-1202页
作者: Kulkarni, Kartik Bansal, Manish Virginia Tech Grad Dept Ind & Syst Engn Blacksburg VA 24061 USA
We study new generalizations of the classic capacitated lot-sizing problem with concave production (or transportation), holding, and subcontracting cost functions in which the total production (or transportation) capa... 详细信息
来源: 评论
Diverse Collections in Matroids and Graphs  38
Diverse Collections in Matroids and Graphs
收藏 引用
38th International Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Fomin, Fedor, V Golovach, Petr A. Panolan, Fahad Philip, Geevarghese Saurabh, Saket Univ Bergen Bergen Norway IIT Hyderabad Dept Comp Sci & Engn Hyderabad India Chennai Math Inst Chennai Tamil Nadu India UMI ReLaX Chennai Tamil Nadu India Inst Math Sci4 Chennai Tamil Nadu India
We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems, two from the theory of matroids and the third from graph theory. The input to the WEIGHTED ... 详细信息
来源: 评论
Solving hard stable matching problems involving groups of similar agents
收藏 引用
THEORETICAL COMPUTER SCIENCE 2020年 844卷 171-194页
作者: Meeks, Kitty Rastegari, Baharak Univ Glasgow Sch Comp Sci Glasgow Lanark Scotland Univ Southampton Dept Elect & Comp Sci Southampton Hants England
Many important stable matching problems are known to be NP-hard, even when strong restrictions are placed on the input. In this paper we seek to identify structural properties of instances of stable matching problems ... 详细信息
来源: 评论
A Polynomial-Time Algorithm to Compute Turaev-Viro Invariants TV4,q of 3-Manifolds with Bounded First Betti Number
收藏 引用
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS 2020年 第5期20卷 1013-1034页
作者: Maria, Clement Spreer, Jonathan INRIA Sophia Antipolis Mediterranee Valbonne France Univ Sydney Sydney NSW 2006 Australia
In this article, we introduce a fixed-parameter tractable algorithm for computing the Turaev-Viro invariants TV4, q, using the first Betti number, i.e. the dimension of the first homology group of the manifold with Z(... 详细信息
来源: 评论
Iterated Type Partitions  31st
Iterated Type Partitions
收藏 引用
31st International Workshop on Combinatorial algorithms (IWOCA)
作者: Cordasco, Gennaro Gargano, Luisa Rescigno, Adele A. Univ Campania L Vanvitelli Caserta Italy Univ Salerno Fisciano Italy
This paper introduces a novel parameter, called iterated type partition, that can be computed in polynomial time and nicely places between modular-width and neighborhood diversity. We prove that the Equitable Coloring... 详细信息
来源: 评论
Backdoors to planning
收藏 引用
ARTIFICIAL INTELLIGENCE 2019年 269卷 49-75页
作者: Kronegger, Martin Ordyniak, Sebastian Pfandler, Andreas Johannes Kepler Univ Linz Linz Austria TU Wien Vienna Austria Univ Sheffield Sheffield S Yorkshire England Univ Siegen Siegen Germany
Backdoors measure the distance to tractable fragments and have become an important tool to find fixed-parameter tractable (fpt) algorithms for hard problems in Al and beyond. Despite their success, backdoors have not ... 详细信息
来源: 评论
Exact algorithms for multi-module capacitated lot-sizing problem, and its generalizations with two-echelons and piecewise concave production costs
A I I E Transactions
收藏 引用
A I I E Transactions 2023年 第12期55卷
作者: Kartik Kulkarni Manish Bansal Grado Department of Industrial and Systems Engineering Virginia Tech Blacksburg VAUSA
We study new generalizations of the classic capacitated lot-sizing problem with concave production (or transportation), holding, and subcontracting cost functions in which the total production (or transportation) capa... 详细信息
来源: 评论
A single-exponential FPT algorithm for the K4-MINOR COVER problem
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2015年 第1期81卷 186-207页
作者: Kim, Eun Jung Paul, Christophe Philip, Geevarghese CNRS LAMSADE Paris France CNRS LIRMM Montpellier France MPII Saarbrucken Germany
Given a graph G and a parameter k is an element of N, the parameterized K-4-MINOR COVER problem asks whether at most k vertices can be deleted to turn G into a K-4-minor-free graph, or equivalently in a graph of treew... 详细信息
来源: 评论