Suchergebnisse - Parameterized complexity algorithms

Special Issue “New Frontiers in Parameterized Complexity and Algorithms”: Foreward by the Guest Editors von Misra, Neeldhara, Rosamond, Frances, Zehavi, Meirav

“… This Special Issue contains eleven articles—surveys and research papers—that represent fresh and ambitious new directions in the area of Parameterized Complexity …”
Volltext

New Frontiers in Parameterized Complexity and Algorithms

“… The research on parameterized complexity (PC), described in these peer-reviewed chapters by esteemed researchers, provides ties to practice as well as new theoretical developments, many in the direction of AI …”
Volltext

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms von Feldmann, Andreas Emil, Karthik C. S., Karthik C., Lee, Euiwoong, Manurangsi, Pasin

“… Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many …”
Volltext

Complexity and parameterized algorithms for Cograph Editing von Liu, Yunlong, Wang, Jianxin, Guo, Jiong, Chen, Jianer

“… Subsequently, we present a parameterized algorithm based on a refined search tree technique with a running time of O(4.612k+|V|4.5 …”
Volltext

A survey of parameterized algorithms and the complexity of edge modification von Crespelle, Christophe, Drange, Pål Grønås, Fomin, Fedor V., Golovach, Petr

“… It describes state of the art in kernelization, subexponential algorithms, and parameterized complexity of graph modification …”
Volltext

Parameterized algorithms and complexity for the traveling purchaser problem and its variants von Xiao, Mingyu, Zhang, Jianan, Lin, Weibo

“… ), we study TPP and its variants from the view of parameterized complexity. We show that TPP and some variants are fixed-parameter tractable by taking the number k of products or the number m of suppliers as the parameter, and W[2]-hard by taking the number q of visited suppliers as the parameter. Furthermore, we implement some of our fixed-parameter tractable algorithms to show that they are practically effective when the parameters are not very large …”
Volltext

The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms von Kanj, Iyad A., Nakhleh, Luay, Xia, Ge

“… , and gave a straightforward brute-force parameterized algorithm for the problem of running time O (3 k n …”
Volltext

Paths of bounded length and their cuts: Parameterized complexity and algorithms von Golovach, Petr A., Thilikos, Dimitrios M.

“… We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem …”
Volltext

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms von Chen, Jianer, Kanj, Iyad A.

“… Motivated by the research in reconfigurable memory array structures, this paper studies the complexity and algorithms for the constrained minimum vertex cover problem on bipartite graphs ( min-cvcb) defined as follows …”
Volltext

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern von Focke, Jacob, Hörsch, Florian, Li, Shaohua, Marx, Dániel

“… The Multicut problem asks for a minimum cut separating certain pairs of vertices: formally, given a graph G and a demand graph H on a set $$T\subseteq V(G)$$ T …”
Volltext

Efficient parameterized algorithms for data packing von Chatterjee, Krishnendu, Goharshady, Amir Kafshdar, Okati, Nastaran, Pavlogiannis, Andreas

“… There is a huge gap between the speeds of modern caches and main memories, and therefore cache misses account for a considerable loss of efficiency in …”
Volltext

Parameterized Complexity of Maximum Edge Colorable Subgraph von Agrawal, Akanksha, Kundu, Madhumita, Sahu, Abhishek, Saurabh, Saket, Tale, Prafullkumar

“… . We study the above problem from the viewpoint of Parameterized Complexity. We obtain FPT algorithms when parameterized by: (1 …”
Volltext

Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis von Conrado, Giovanna Kobus, Goharshady, Amir Kafshdar, Kochekov, Kerim, Tsai, Yun Chen, Zaher, Ahmed Khaled

“… Algebraic Program Analysis (APA) is a ubiquitous framework that has been employed as a unifying model for various problems in data-flow analysis, termination …”
Volltext

On the Parameterized Complexity of Layered Graph Drawing: Parameterized and Exact Algorithms von DUJMOVIC, Vida, FELLOWS, Michael R, KITCHING, Matthew, LIOTTA, Giuseppe, MCCARTIN, Catherine, NISHIMURA, Naomi, RAGDE, Prabhakar, ROSAMOND, Frances, WHITESIDES, Sue, WOOD, David R

Volltext

AWDIT: An Optimal Weak Database Isolation Tester von Møldrup, Lasse, Pavlogiannis, Andreas

“… In order to test databases on realistic workloads of large size, isolation testers must be as efficient as possible, a requirement that has initiated a study of the complexity of isolation testing …”
Volltext

Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem von Baguley, Samuel, Friedrich, Tobias, Neumann, Aneta, Neumann, Frank, Pappik, Marcus, Zeif, Ziena

“… In this work, we combine this field with evolutionary algorithms and provide parameterized complexity analysis of evolutionary multi-objective algorithms for the W -separator problem, which is a …”
Volltext

Gerrymandering on graphs: Computational complexity and parameterized algorithms von Gupta, Sushmita, Jain, Pallavi, Panolan, Fahad, Roy, Sanjukta, Saket Saurabh

“… ] about the computational complexity of the problem when the input graph is a path. Next, we propose a generalization of their model, where the input consists of a graph on \(n …”
Volltext

Improved Algorithms and Complexity Results for Power Domination in Graphs: Parameterized and Exact Algorithms von JIONG GUO, NIEDERMEIER, Rolf, RAIBLE, Daniel

Volltext

Integer programming in parameterized complexity: Five miniatures von Gavenčiak, Tomáš, Koutecký, Martin, Knop, Dušan

“… Powerful results from the theory of integer programming have recently led to substantial advances in parameterized complexity …”
Volltext

Parameterized Complexity of Geodetic Set von Kellerhals, Leon, Koana, Tomohiro

“… }}$ restricted to special graph classes, we initiate a parameterized complexity study of ${\rm G{\small EODETIC}~S{ \small ET}}$ and show, on the one side …”
Volltext