Search Results - parameterized algorithms

Parameterized algorithms for the Steiner arborescence problem on a hypercube: Parameterized algorithms for the Steiner arborescence by Mahapatra, Sugyani, Narayanan, Manikandan, Narayanaswamy, N. S.

“… As m implicitly represents Q → m comprising 2 m vertices, the running time analyses of traditional Steiner tree algorithms on general graphs does not give a clear understanding of the actual complexity of this problem…”
Get full text

Further parameterized algorithms for the F -free edge deletion problem by Gaikwad, Ajinkya, Maity, Soumen

Get full text

Parameterized algorithms and data reduction for the short secluded s‐t‐path problem by Bevern, René, Fluschnik, Till, Tsidulko, Oxana Yu

“… s‐t‐path with at most k vertices and ℓ neighbors. We study the parameterized complexity of the problem with respect to four structural graph parameters…”
Get full text

An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem by Chen, Jianer, Liu, Yang, Lu, Songjian

“…The parameterized node multiway cut problem is for a given graph to find a separator of size bounded by k whose removal separates a collection of terminal sets in the graph…”
Get full text

Parameterized algorithms for min–max 2-cluster editing by Chen, Li-Hsuan, Wu, Bang Ye

“… In this paper, we design parameterized algorithms for different ranges of t . Let k = t - n / 4 . We show that the problem is polynomial-time solvable when roughly k…”
Get full text

Parameterized algorithms for locating-dominating sets by Cappelle, Márcia R., Gomes, Guilherme C.M, Santos, Vinicius F. dos

“… The latter naturally leads to questions on the parameterized complexity of the problem. While some have already been answered, in this work…”
Get full text

Parameterized Algorithms for Queue Layouts by Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin

“… of $G$. We present two fixed-parameter tractable algorithms that exploit structural properties of graphs to compute optimal queue layouts…”
Get full text

Parameterized algorithms for minimum sum vertex cover by Aute, Shubhada, Panolan, Fahad

“… than 1.014 for MSVC is NP-hard, assuming the Unique Games Conjecture. We study the MSVC problem from the perspective of parameterized algorithms…”
Get full text

Simple and Improved Parameterized Algorithms for Multiterminal Cuts by Xiao, Mingyu

“… ≥3 but well-known to be polynomial-time solvable for k =2 by the flow technique. In this paper, based on a notion farthest minimum isolating cut , we design several simple and improved algorithms for Multiterminal Cut…”
Get full text

Parameterized algorithms for d - Hitting Set: The weighted case by Fernau, Henning

“…We are going to analyze search tree algorithms for Weighted d - Hitting Set. Although the algorithms that we develop are fairly simple, their analysis is technically involved…”
Get full text

Parameterized Algorithms for Book Embedding Problems by Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin

“…}}$ are fixed-parameter tractable parameterized by the vertex cover number of the graph and that ${\rm F{\small IXED}-O{\small RDER}~B{\small OOK}~T{\small HICKNESS}}$ is fixed-parameter tractable parameterized by the pathwidth of the vertex order…”
Get full text

Faster approximation schemes and parameterized algorithms on (odd-) H -minor-free graphs by Tazari, Siamak

“…]. We use these algorithms to derive faster 2-approximations; furthermore, we present the first PTASes and subexponential FPT-algorithms for independent set and vertex cover on these graph classes using a novel dynamic programming technique…”
Get full text

On Unknown Small Subsets and Implicit Measures： New Techniques for Parameterized Algorithms by 陈建二 冯启龙

“… problems.Developing efficient parameterized algorithms has become a very active research area in the current research in theoretical computer science…”
Get full text

Parameterized algorithms for finding highly connected solution by Abhinav, Ankit, Bandopadhyay, Susobhan, Banik, Aritra, Saurabh, Saket

“…=n−1, we obtain the Connected Vertex Cover problem. A simple observation also shows that the problem admits an algorithm with running time nO(k…”
Get full text

Parameterized algorithms of fundamental NP-hard problems: a survey by Li, Wenjun, Ding, Yang, Yang, Yongjie, Sherratt, R. Simon, Park, Jong Hyuk, Wang, Jin

“… We give an overview on parameterized algorithms for some fundamental NP-hard problems, including MaxSAT, Maximum Internal Spanning Trees, Maximum Internal Out-Branching, Planar (Connected…”
Get full text

An O⁎(1.84k) parameterized algorithm for the multiterminal cut problem by Cao, Yixin, Chen, Jianer, Fan, J.-H.

“… vertex is with a terminal or not. This bounded search tree algorithm can be shown…”
Get full text

Improved Parameterized Algorithms for Cluster Vertex Deletion by Tian, Kangyi, Xiao, Mingyu, Yang, Boting

“…In the Cluster Vertex Deletion problem, we are given a graph G and an integer k , and the goal is to determine whether we can delete at most k vertices from G…”
Get full text

Exact and parameterized algorithms for choosability by Bliznets, Ivan, Nederlof, Jesper

“… The main objective of our paper is to construct the first non-trivial exact exponential algorithms for the C hoosability problem, and complete the picture with parameterized…”
Get full text

Missing Link Prediction using Common Neighbor and Centrality based Parameterized Algorithm by Ahmad, Iftikhar, Akhtar, Muhammad Usman, Noor, Salma, Shahnaz, Ambreen

“… “Common Neighbor and Centrality based Parameterized Algorithm” (CCPA) to suggest the formation of new links in complex networks. Using AUC…”
Get full text

Parameterized algorithms for multi-label periodic temporal graph realization by Erlebach, Thomas, Morawietz, Nils, Wolf, Petra

“…In the periodic temporal graph realization problem introduced by Klobas et al. [SAND '24] one is given a period Δ and an n×n matrix D of desired fastest travel…”
Get full text