Suchergebnisse - "Parameterized algorithms"

Max-SAT with cardinality constraint parameterized by the number of clauses von Jain, Pallavi, Kanesh, Lawqueen, Panolan, Fahad, Saha, Souvik, Sahu, Abhishek, Saurabh, Saket, Upasana, Anannya

“… Max-SAT with cardinality constraint (CC-Max-SAT) is one of the classical NP-complete problems. In this problem, given a CNF-formula Φ on n variables, positive …”
Volltext

Cluster Editing with Vertex Splitting von Abu-Khzam, Faisal N., Arrighi, Emmanuel, Bentert, Matthias, Drange, Pål Grønås, Egan, Judith, Gaspers, Serge, Shaw, Alexis, Shaw, Peter, Sullivan, Blair D., Wolf, Petra

“… Cluster Editing, also known as Correlation Clustering, is a well-studied graph modification problem. In this problem, one is given a graph and the task is to …”
Volltext

An improved kernel and parameterized algorithm for deletion to induced matching von Liu, Yuxi, Xiao, Mingyu

“… A graph is called an induced matching if each vertex in the graph is a degree-1 vertex. The Deletion to Induced Matching problem asks whether we can delete at …”
Volltext

Algorithm runtime prediction: Methods & evaluation von Hutter, Frank, Xu, Lin, Hoos, Holger H., Leyton-Brown, Kevin

“… Perhaps surprisingly, it is possible to predict how long an algorithm will take to run on a previously unseen input, using machine learning techniques to build …”
Volltext

Parameterized approximation algorithms for weighted vertex cover von Mandal, Soumen, Misra, Pranabendu, Rai, Ashutosh, Saurabh, Saket

“… A vertex cover of a graph is a set of vertices of the graph such that every edge has at least one endpoint in it. In this work, we study Weighted Vertex Cover …”
Volltext

On MAX–SAT with cardinality constraint von Panolan, Fahad, Yaghoubizade, Hannane

“… We consider the weighted MAX–SAT problem with an additional constraint that at mostk variables can be set to true. We call this problem k–WMAX–SAT. This …”
Volltext

Vertex identification to a forest von Morelle, Laure, Sau, Ignasi, Thilikos, Dimitrios M.

“… Let H be a graph class and k∈N. We say a graph G admits a k-identification toH if there is a partition P of some set X⊆V(G) of size at most k such that after …”
Volltext

Finding Temporal Paths Under Waiting Time Constraints von Casteigts, Arnaud, Himmel, Anne-Sophie, Molter, Hendrik, Zschoche, Philipp

“… Computing a (short) path between two vertices is one of the most fundamental primitives in graph algorithmics. In recent years, the study of paths in temporal …”
Volltext

The complexity of cluster vertex splitting and company von Firbas, Alexander, Dobler, Alexander, Holzer, Fabian, Schafellner, Jakob, Sorge, Manuel, Villedieu, Anaïs, Wißmann, Monika

“… Clustering a graph when the clusters can overlap can be seen from three different angles: We may look for cliques that cover the edges of the graph with …”
Volltext

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

“… To introduce our question and the parameterization, consider the classical Vertex Cover problem. In this problem, the input is a graph G on n vertices and a …”
Volltext

Parameterized complexity of configuration integer programs von Knop, Dušan, Koutecký, Martin, Levin, Asaf, Mnich, Matthias, Onn, Shmuel

“… Configuration integer programs (IP) have been key in the design of algorithms for NP-hard high-multiplicity problems. First, we develop fast exact …”
Volltext

A parameterized algorithm for subset feedback vertex set in tournaments von Bai, Tian, Xiao, Mingyu

“… The Subset Feedback Vertex Set problem (SFVS) takes an n-vertex graph G=(V,E), a terminal set T⊆V, and an integer k as the input. The goal is to determine …”
Volltext

A 5k-vertex kernel for 3-path vertex cover von Xiao, Mingyu, Kou, Shaowei

“… A 3-path vertex cover in a graph is a vertex subset C such that every path of three vertices contains at least one vertex from C. The parameterized 3-path …”
Volltext

Exact and parameterized algorithms for the independent cutset problem von Rauch, Johannes, Rautenbach, Dieter, Souza, Uéverton S.

“… The Independent Cutset problem asks whether there is a set of vertices in a given graph that is both independent and a cutset. This problem is ▪-complete even …”
Volltext

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem von Ganian, Robert, Klute, Fabian, Ordyniak, Sebastian

“… We study the parameterized complexity of the Bounded-Degree Vertex Deletion problem (BDD), where the aim is to find a maximum induced subgraph whose maximum …”
Volltext

SAT backdoors: Depth beats size von Dreier, Jan, Ordyniak, Sebastian, Szeider, Stefan

“… For several decades, much effort has been put into identifying classes of CNF formulas whose satisfiability can be decided in polynomial time. Classic results …”
Volltext

A note on clustering aggregation for binary clusterings von Chen, Jiehua, Hermelin, Danny, Sorge, Manuel

“… We consider the clustering aggregation problem in which we are given a set of clusterings and want to find an aggregated clustering which minimizes the sum of …”
Volltext

Exact algorithms for restricted subset feedback vertex set in chordal and split graphs von Bai, Tian, Xiao, Mingyu

Volltext

An improved kernel for planar vertex-disjoint triangle packing von Sheng, Zimo, Xiao, Mingyu

“… Triangle Packing is an important NP-hard problem that has been well studied in exact and parameterized complexity. In this paper, we study kernelization of the …”
Volltext

A more accurate view of the Flat Wall Theorem von Sau, Ignasi, Stamoulis, Giannos, Thilikos, Dimitrios M.

“… We introduce a supporting combinatorial framework for the Flat Wall Theorem. In particular, we suggest two variants of the theorem and we introduce a new, more …”
Volltext