Filters








9 Hits in 3.1 sec

Report from Dagstuhl Seminar 14071 Graph Modification Problems

Hans Bodlaender, Pinar Heggernes, Daniel Lokshtanov
unpublished
This report documents the program and the outcomes of Dagstuhl  ...  The main objective of the seminar was to bring together experts within Parameterized Algorithms and experts within Graph Classes to join forces on graph modification problems.  ...  Algorithmica 68(1):41-61 (2014) 4 0 7 1 -Graph Modification Problems 4 0 7 1 4 0 7 1 4 0 7 1 -Graph Modification Problems 4 0 7 1 4 0 7 1 -Graph Modification  ... 
fatcat:qyursb4aenfmtnz7vmpw3icvxy

Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics [article]

Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
2016 arXiv   pre-print
In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting graph fulfills a certain  ...  Graph modification problems appear in numerous applications, including the analysis of biological and social networks.  ...  Also refer to the 2014 Dagstuhl Seminar 14071 on "Graph Modification Problems" organized by Hans L. Bodlaender, Pinar Heggernes, and Daniel Lokshtanov [5] .  ... 
arXiv:1606.03268v1 fatcat:6ucc6vh32rfajofrbdsxtcpznq

Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics [chapter]

Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
2016 Lecture Notes in Computer Science  
In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting graph fulfills a certain  ...  Graph modification problems appear in numerous applications, including the analysis of biological and social networks.  ...  Also refer to the 2014 Dagstuhl Seminar 14071 on "Graph Modification Problems" organized by Hans L. Bodlaender, Pinar Heggernes, and Daniel Lokshtanov [4] .  ... 
doi:10.1007/978-3-662-53174-7_1 fatcat:kegsdk75mncyhjecqz3ztmtffa

On Kernelization and Approximation for the Vector Connectivity Problem

Stefan Kratsch, Manuel Sorge
2016 Algorithmica  
In the vector connectivity problem we are given an undirected graph G = (V, E), a demand function φ : V → {0, . . . , d}, and an integer k.  ...  The problem is NP-hard already for instances with d = 4 (Cicalese et al., Theor. Comput.  ...  In a related talk during a recent Dagstuhl seminar (Dagstuhl Seminar 14071 on "Graph Modification Problems.")  ... 
doi:10.1007/s00453-016-0231-y fatcat:7nyikc3glbclncuc3mveb3kruy

2014 Jahresbericht Annual Report

Registernummer Amtsgericht, Saarbrücken Hrb, Vorsitzender Des Aufsichtsrates, Ing, Jähnichen Stefan, Raimund Geschäftsführung, Seidel, Heike Meißner, Technisch-Administrative Geschäftsführerin, Gesellschafter
unpublished
The demonstrations presented at the seminar were by: Guido Tack  ...  The seminar was organized into seven sessions: frameworks and languages; algorithm configuration; constraints in pattern mining; learning constraints; machine learning with constraints; applications; and  ...  In the setting of graph modification problems we have no restrictions on the input graph, but the problem definitions dictate which graph class the output graph should belong to.  ... 
fatcat:jojclrrbifa2lgyh3ux4tv7tiu

On Kernelization and Approximation for the Vector Connectivity Problem [article]

Stefan Kratsch, Manuel Sorge
2015 arXiv   pre-print
In the Vector Connectivity problem we are given an undirected graph G=(V,E), a demand function ϕ V→{0,...,d}, and an integer k.  ...  The problem is -hard already for instances with d=4 (Cicalese et al., arXiv '14), admits a log-factor approximation (Boros et al., Networks '14), and is fixed-parameter tractable in terms of k (Lokshtanov  ...  Dagstuhl Seminar 14071 on "Graph Modification Problems." 2 Unpublished result.  ... 
arXiv:1410.8819v2 fatcat:zjnqz5743rfl3miceeheevdcsa

Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs

Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2014 2014 IEEE 55th Annual Symposium on Foundations of Computer Science  
van (2014) Network sparsification for Steiner problems on planar and bounded-genus graphs.  ...  We would like also to acknowledge the support and extremely productive atmosphere at Dagstuhl Seminars 13121, 13421 and 14071.  ...  Moreover, we acknowledge the discussions with Daniel Lokshtanov that lead to the discovery that the NP-hardness proof for Steiner Forest on planar graphs of treewidth 3 of Bateni et al.  ... 
doi:10.1109/focs.2014.37 dblp:conf/focs/PilipczukPSL14 fatcat:33nagim3pvejpkiakhdive3zsy

Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs [article]

Marcin Pilipczuk, Michał Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2017 arXiv   pre-print
We propose polynomial-time algorithms that sparsify planar and bounded-genus graphs while preserving optimal or near-optimal solutions to Steiner problems.  ...  and forest, respectively) and for (Edge) Multiway Cut on planar graphs (parameterized by the size of the cutset).  ...  We would like also to acknowledge the support and extremely productive atmosphere at Dagstuhl Seminars 13121, 13421 and 14071.  ... 
arXiv:1306.6593v4 fatcat:oddhcwecevg5xhyo5mlqkzl3gm

Be sparse! Be dense! Be robust! [article]

Manuel Sorge, Technische Universität Berlin, Technische Universität Berlin, Rolf Niedermeier
2017
In this thesis we study the computational complexity of five NP-hard graph problems.  ...  That is, it shall remain a good solution, even when it suffers several small modifications. Be sparse! In this part of the thesis, we analyze two similar problems.  ...  Dagstuhl Seminar 14071 on "Graph Modification Problems", February 9-14, 2014. 16 Unpublished result. | > d 3 , violating the definition of Y and the sets therein.  ... 
doi:10.14279/depositonce-5635 fatcat:4hyi7tx5tfcupo5rgjxmokfecm