Výsledky vyhledávání - "fixed-parameter algorithm"

Orientable burning number of graphs Autor Courtiel, Julien, Dorbec, Paul, Gima, Tatsuya, Lecoq, Romain, Otachi, Yota

“…In this paper, we introduce the problem of finding an orientation of a given undirected graph that maximizes the burning number of the resulting directed…”
Získat plný text

Parameterized Algorithms for the Spanning Forest Isomorphism and Containment on Tree Autor Liu, Jingyi, Chen, Xian, Zheng, Yicheng, Wang, Jianxin, Shi, Feng

Získat plný text

Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane Autor Cambazard, Hadrien, Catusse, Nicolas

“…•A fixed-parameter algorithm for the rectilinear travelling salesman problem.•A fixed-parameter algorithm for the rectilinear Steiner tree problem.•A refined…”
Získat plný text

Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs Autor Giannopoulou, Archontia C., Mertzios, George B., Niedermeier, Rolf

“…We study the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time. The main motivation is to get more efficient…”
Získat plný text

Faster deterministic Feedback Vertex Set Autor Kociumaka, Tomasz, Pilipczuk, Marcin

“…We present a new deterministic algorithm for the Feedback Vertex Set problem parameterized by the solution size. Our algorithm runs in O⁎((2+ϕ)k) time, where…”
Získat plný text

A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments Autor van Bevern, René, Komusiewicz, Christian, Sorge, Manuel

“…We prove that any polynomial‐time α ( n ) ‐approximation algorithm for the n‐vertex metric asymmetric Traveling Salesperson Problem yields a polynomial‐time O…”
Získat plný text

The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable Autor Afanasev, Vsevolod A., van Bevern, René, Tsidulko, Oxana Yu

“…The Hierarchical Chinese Postman Problem is finding a shortest traversal of all edges of a graph respecting precedence constraints given by a partial order on…”
Získat plný text

A fixed-parameter algorithm for the vertex cover P3 problem Autor Tu, Jianhua

“…A subset F of vertices of a graph G is called a vertex cover Pt set if every path of order t in G contains at least one vertex from F. Denote by ψt(G) the…”
Získat plný text

A faster FPT algorithm for 3-path vertex cover Autor Katrenic, Ján

“…•The k-path vertex cover problem (k-PVCP) is to find a minimum set of vertices that meets every path of order k in G.•The k-PVCP problem is NP-hard for any…”
Získat plný text

New algorithms for maximum disjoint paths based on tree-likeness Autor Fleszar, Krzysztof, Mnich, Matthias, Spoerhase, Joachim

“…We study the classical  NP -hard problems of finding maximum-size subsets from given sets of  k terminal pairs that can be routed via edge-disjoint paths (…”
Získat plný text

An improved FPT algorithm for Almost Forest Deletion problem Autor Lin, Mugang, Feng, Qilong, Wang, Jianxin, Chen, Jianer, Fu, Bin, Li, Wenjun

“…Almost Forest Deletion problem (AFD) is a generalization of the Feedback Vertex Set problem, which decides whether there exist at most k vertices in a given…”
Získat plný text

A fixed-parameter algorithm for a unit-execution-time unit-communication-time tasks scheduling problem with a limited number of identical processors Autor Kordon, Alix Munier, Tang, Ning

“…This paper considers the minimization of the maximum lateness for a set of dependent tasks with unit duration, unit communication delays release times and due…”
Získat plný text

Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network Autor Shi, Feng, Li, Hangcheng, Rong, Guozhen, Zhang, Zhen, Wang, Jianxin

“…Phylogenetic trees are unable to represent the evolutionary process for a collection of species if reticulation events happened, and a generalized model named…”
Získat plný text

A fixed-parameter algorithm for guarding 1.5D terrains Autor Khodakarami, Farnoosh, Didehvar, Farzad, Mohades, Ali

“…A 1.5D terrain is a region on a plane determined by an x-monotone polygonal chain. A set G of points on the terrain is called a guarding set if every point on…”
Získat plný text

Computing a Consensus Phylogeny via Leaf Removal Autor Chen, Zhi-Zhong, Ueta, Shohei, Li, Jingyu, Wang, Lusheng

“…[Formula: see text]…”
Zjistit podrobnosti o přístupu

Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem Autor Czeizler, Eugen, Popa, Alexandru, Popescu, Victor

“…Recent research has revealed new and unexpected applications of network control science within biomedicine, pharmacology, and medical therapeutics. These new…”
Získat plný text

Fixed-parameter algorithms for vertex cover P3 Autor Chang, Maw-Shang, Chen, Li-Hsuan, Hung, Ling-Ju, Rossmanith, Peter, Su, Ping-Chen

“…Let Pℓ denote a path in a graph G=(V,E) with ℓ vertices. A vertex coverPℓsetC in G is a vertex subset such that every Pℓ in G has at least a vertex in C. The…”
Získat plný text

Coloring immersion-free graphs Autor Kakimura, Naonori, Kawarabayashi, Ken-ichi

“…A graph H is immersed in a graph G if the vertices of H are mapped to (distinct) vertices of G, and the edges of H are mapped to paths joining the…”
Získat plný text

Fixed-parameter tractability for subset feedback set problems with parity constraints Autor Kakimura, Naonori, Kawarabayashi, Ken-ichi

“…The subset feedback set problem, which is a generalization of the well-known feedback vertex set problem, is that we are given an undirected graph G with a…”
Získat plný text

Faster Exact Computation of rSPR Distance via Better Approximation Autor Chen, Zhi-Zhong, Harada, Youta, Nakamura, Yuna, Wang, Lusheng

“…Due to hybridization events in evolution, studying two different genes of a set of species may yield two related but different phylogenetic trees for the set…”
Získat plný text