咨询与建议

限定检索结果

文献类型

  • 60 篇 期刊文献
  • 7 篇 会议
  • 1 篇 学位论文
  • 1 篇 资讯

馆藏范围

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

日期分布

学科分类号

  • 52 篇 工学
    • 49 篇 计算机科学与技术...
    • 12 篇 软件工程
    • 2 篇 电气工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 安全科学与工程
  • 34 篇 理学
    • 33 篇 数学
    • 2 篇 生物学
    • 1 篇 统计学(可授理学、...
  • 10 篇 管理学
    • 10 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 2 篇 法学
    • 2 篇 法学
  • 1 篇 经济学
    • 1 篇 应用经济学
  • 1 篇 农学

主题

  • 69 篇 fixed-parameter ...
  • 8 篇 computational bi...
  • 7 篇 kernelization
  • 7 篇 parameterized co...
  • 6 篇 graph algorithms
  • 5 篇 approximation al...
  • 5 篇 computational co...
  • 4 篇 computational st...
  • 4 篇 set packing
  • 4 篇 the closest stri...
  • 4 篇 treewidth
  • 3 篇 np-hard problems
  • 3 篇 rank-width
  • 3 篇 haplotyping
  • 3 篇 crown decomposit...
  • 3 篇 planar graphs
  • 2 篇 branch-decomposi...
  • 2 篇 phylogenetics
  • 2 篇 split graphs
  • 2 篇 satisfiability p...

机构

  • 5 篇 city univ hong k...
  • 4 篇 simon fraser uni...
  • 4 篇 tokyo denki univ...
  • 3 篇 technion israel ...
  • 3 篇 mit comp sci & a...
  • 2 篇 univ bonn bonn
  • 2 篇 city univ hong k...
  • 2 篇 med univ lubeck ...
  • 2 篇 budapest univ te...
  • 2 篇 univ milano bico...
  • 2 篇 tu hamburg inst ...
  • 2 篇 lebanese amer un...
  • 2 篇 univ jena inst i...
  • 2 篇 tu wien algorith...
  • 2 篇 hamburg univ tec...
  • 2 篇 czech tech univ ...
  • 2 篇 city univ hong k...
  • 2 篇 univ waterloo sc...
  • 2 篇 univ bergen dept...
  • 2 篇 natl & capodistr...

作者

  • 7 篇 chen zhi-zhong
  • 6 篇 mnich matthias
  • 6 篇 wang lusheng
  • 6 篇 dondi riccardo
  • 5 篇 komusiewicz chri...
  • 4 篇 jia xiaohua
  • 4 篇 marzban marjan
  • 4 篇 abu-khzam faisal...
  • 4 篇 gu qian-ping
  • 3 篇 eiben eduard
  • 3 篇 ganian robert
  • 3 篇 marx daniel
  • 3 篇 razgon igor
  • 3 篇 tantau till
  • 3 篇 ma bin
  • 2 篇 pilipczuk marcin
  • 2 篇 sorge manuel
  • 2 篇 schlotter ildiko
  • 2 篇 elberfeld michae...
  • 2 篇 zoppis italo

语言

  • 60 篇 英文
  • 9 篇 其他
检索条件"主题词=Fixed-parameter algorithms"
69 条 记 录,以下是1-10 订阅
排序:
Randomized fixed-parameter algorithms for the Closest String Problem
收藏 引用
ALGORITHMICA 2016年 第1期74卷 466-484页
作者: Chen, Zhi-Zhong Ma, Bin Wang, Lusheng Tokyo Denki Univ Div Informat Syst Design Hiki Saitama 3500394 Japan Univ Waterloo Sch Comp Sci Waterloo ON N2L 3G1 Canada City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China
Given a set of strings of equal length and an integer , the closest string problem (CSP) requires the computation of a string of length such that for each , where is the Hamming distance between and . The problem is N... 详细信息
来源: 评论
Bounds and fixed-parameter algorithms for Weighted Improper Coloring
收藏 引用
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2016年 322卷 181-195页
作者: Gudmundsson, Bjarki Agust Magnusson, Tomas Ken Saemundsson, Bjorn Orri Reykjavik Univ Sch Comp Sci ICE TCS Reykjavik Iceland
We study the weighted improper coloring problem, a generalization of defective coloring. We present some hardness results and in particular we show that weighted improper coloring is not fixed-parameter tractable when... 详细信息
来源: 评论
fixed-parameter algorithms FOR FINDING AGREEMENT SUPERTREES
收藏 引用
SIAM JOURNAL ON COMPUTING 2015年 第2期44卷 384-410页
作者: Fernandez-Baca, David Guillemot, Sylvain Shutters, Brad Vakati, Sudheer Iowa State Univ Dept Comp Sci Ames IA 50011 USA Hungarian Acad Sci Comp & Automat Res Inst H-1111 Budapest Hungary Univ Wisconsin Dept Comp Sci La Crosse WI 54601 USA Amazon Com Seattle WA 98108 USA
We study the agreement supertree approach for combining rooted phylogenetic trees when the input trees do not fully agree on the relative positions of the taxa. We consider two ways to deal with such conflict. The fir... 详细信息
来源: 评论
fixed-parameter algorithms for scaffold filling
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 第C期568卷 72-83页
作者: Bulteau, Laurent Carrieri, Anna Paola Dondi, Riccardo Tech Univ Berlin Dept Software Engn & Theoret Comp Sci Berlin Germany Univ Milano Bicocca Dipartimento Informat Sistemist & Comunicaz Milan Italy Univ Bergamo Dipartimento Sci Umane & Soc Bergamo Italy
The new sequencing technologies, called next-generation sequencing, provide a huge amount of data that can be used to reconstruct genomes. However, the methods applied to reconstruct genomes often are not able to reco... 详细信息
来源: 评论
A Practical fixed-parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees
收藏 引用
ALGORITHMICA 2022年 第4期84卷 917-960页
作者: van Iersel, Leo Janssen, Remie Jones, Mark Murakami, Yukihiro Zeh, Norbert Delft Univ Technol Delft Inst Appl Math Broekmanweg 6 NL-2628 XE Delft Netherlands Dalhousie Univ Fac Comp Sci 6050 Ave Halifax NS B3H 1W5 Canada
We present the first fixed-parameter algorithm for constructing a tree-child phylo-genetic network that displays an arbitrary number of binary input trees and has the minimum number of reticulations among all such net... 详细信息
来源: 评论
Shortest odd paths in undirected graphs with conservative weight functions
收藏 引用
DISCRETE APPLIED MATHEMATICS 2024年 357卷 34-50页
作者: Juettner, Alpar Kiraly, Csaba Mendoza-Cadena, Lydia Mirabel Pap, Gyula Schlotter, Ildiko Yamaguchi, Yutaro Eotv Lorand Res Network ELKH ELKH ELTE Egervary Res Grp Budapest Hungary Eotvos Lorand Univ Dept Operat Res Budapest Hungary MTA ELTE Matroid Optimizat Res Grp Budapest Hungary HUN REN Ctr Econ & Reg Stud Budapest Hungary Budapest Univ Technol & Econ Budapest Hungary Osaka Univ Grad Sch Informat Sci & Technol Dept Informat & Phys Sci Osaka Japan
We consider the SHORTEST ODD PATH problem, where given an undirected graph G, a weight function on its edges, and two vertices s and t in G, the aim is to find an (s, t)-path with odd length and, among all such paths,... 详细信息
来源: 评论
High-multiplicity N-fold IP via configuration LP
收藏 引用
MATHEMATICAL PROGRAMMING 2023年 第1期200卷 199-227页
作者: Knop, Dusan Koutecky, Martin Levin, Asaf Mnich, Matthias Onn, Shmuel Czech Tech Univ Fac Informat Technol Dept Theoret Comp Sci Prague Czech Republic Charles Univ Prague Fac Math & Phys Comp Sci Inst Prague Czech Republic Technion Israel Inst Technol Haifa Israel Hamburg Univ Technol Inst Algorithms & Complex Hamburg Germany
N-fold integer programs (IPs) form an important class of block-structured IPs for which increasingly fast algorithms have recently been developed and successfully applied. We study high-multiplicityN-fold IPs, which e... 详细信息
来源: 评论
parameterized algorithms for generalizations of Directed Feedback Vertex Set
收藏 引用
DISCRETE OPTIMIZATION 2022年 第0期46卷
作者: Goke, Alexander Marx, Daniel Mnich, Matthias Hamburg Univ Technol Inst Algorithms & Complex Hamburg Germany CISPA Helmholtz Ctr Informat Secur Saarbrucken Germany
The DIRECTED FEEDBACK VERTEX SET (DFVS) problem takes as input a directed graph G and seeks a smallest vertex set S that hits all cycles in G. This is one of Karp's 21 NP-complete problems. Resolving the parameter... 详细信息
来源: 评论
Identifying duplications and lateral gene transfers simultaneously and rapidly
收藏 引用
JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY 2022年 第1期20卷 2150033-2150033页
作者: Chen, Zhi-Zhong Deng, Fei Wang, Lusheng Tokyo Denki Univ Div Informat Syst Design Hatoyama Saitama 3500394 Japan City Univ Hong Kong Dept Comp Sci Kowloon Tat Chee Ave Hong Kong Peoples R China
This paper deals with the problem of enumerating all minimum-cost LCA-reconciliations involving gene duplications and lateral gene transfers (LGTs) for a given species tree S and a given gene tree G. Previously, [Tofi... 详细信息
来源: 评论
Finding a minimum spanning tree with a small non-terminal set
收藏 引用
THEORETICAL COMPUTER SCIENCE 2025年 1033卷
作者: Hanaka, Tesshu Kobayashi, Yasuaki Kyushu Univ Fukuoka Japan Hokkaido Univ Sapporo Japan
In this paper, we study the problem of finding a minimum weight spanning tree that contains each vertex in a given subset VNT of vertices as an internal vertex. This problem, called MINIMUM WEIGHT NON-TERMINAL SPANNIN... 详细信息
来源: 评论