On efficient fixed-parameter algorithms for weighted vertex cover By Rolf Niedermeier & Peter Rossmanith Presentation by Peerapol Bhuaratnarunkon April.

Slides:



Advertisements
Similar presentations
Weighted Matching-Algorithms, Hamiltonian Cycles and TSP
Advertisements

Lindsey Bleimes Charlie Garrod Adam Meyerson
What is Intractable? Some problems seem too hard to solve efficiently. Question 1: Does an efficient algorithm exist?  An O(a ) algorithm, where a > 1,
1 NP-completeness Lecture 2: Jan P The class of problems that can be solved in polynomial time. e.g. gcd, shortest path, prime, etc. There are many.
Approximative Kernelization: On the Trade-off between Fidelity and Kernel Size joint with Michael Fellows and Frances Rosamond Charles Darwin University.
1 Steiner Tree on graphs of small treewidth Algorithms and Networks 2014/2015 Hans L. Bodlaender Johan M. M. van Rooij.
1 Partition Into Triangles on Bounded Degree Graphs Johan M. M. van Rooij Marcel E. van Kooten Niekerk Hans L. Bodlaender.
Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems Algorithmica(2003) Jens Gramm, Rolf Niedermeier, Peter Rossmanith.
Fast FAST By Noga Alon, Daniel Lokshtanov And Saket Saurabh Presentation by Gil Einziger.
1 Reduction between Transitive Closure & Boolean Matrix Multiplication Presented by Rotem Mairon.
02/01/11CMPUT 671 Lecture 11 CMPUT 671 Hard Problems Winter 2002 Joseph Culberson Home Page.
Computational problems, algorithms, runtime, hardness
Data Transmission and Base Station Placement for Optimizing Network Lifetime. E. Arkin, V. Polishchuk, A. Efrat, S. Ramasubramanian,V. PolishchukA. EfratS.
Graph Modeled Data Clustering: Fixed Parameter Algorithms for Clique Generation J. Gramm, J. Guo, F. Hüffner and R. Niedermeier Theory of Computing Systems.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2006 Lecture 2 Monday, 9/13/06 Design Patterns for Optimization Problems.
An Efficient Fixed Parameter Algorithm for 3-Hitting Set
Approximation Algorithms
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Monday, 12/2/02 Design Patterns for Optimization Problems Greedy.
Randomized Process of Unknowns and Implicitly Enforced Bounds on Parameters Jianer Chen Department of Computer Science & Engineering Texas A&M University.
A New Algorithm for Optimal 2-Constraint Satisfaction and Its Implications Ryan Williams Computer Science Department, Carnegie Mellon University Presented.
Fixed-Parameter Algorithms for (k,r)-Center in Planar Graphs and Map Graphs Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, and Dimitrios M.
Backtracking Reading Material: Chapter 13, Sections 1, 2, 4, and 5.
An introduction to Approximation Algorithms Presented By Iman Sadeghi.
Approximation Algorithms Motivation and Definitions TSP Vertex Cover Scheduling.
Outline Introduction The hardness result The approximation algorithm.
MCS312: NP-completeness and Approximation Algorithms
Fixed Parameter Complexity Algorithms and Networks.
GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,
Introduction to Job Shop Scheduling Problem Qianjun Xu Oct. 30, 2001.
CSCE350 Algorithms and Data Structure Lecture 17 Jianjun Hu Department of Computer Science and Engineering University of South Carolina
Advanced Algorithm Design and Analysis (Lecture 13) SW5 fall 2004 Simonas Šaltenis E1-215b
1 Bart Jansen Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter STACS 2011, Dortmund March 10 th, 2011 Joint work with.
1 Steiner Tree Algorithms and Networks 2014/2015 Hans L. Bodlaender Johan M. M. van Rooij.
An Efficient Algorithm for Enumerating Pseudo Cliques Dec/18/2007 ISAAC, Sendai Takeaki Uno National Institute of Informatics & The Graduate University.
CSE332: Data Abstractions Lecture 24.5: Interlude on Intractability Dan Grossman Spring 2012.
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
Minimum Spanning Trees CS 146 Prof. Sin-Min Lee Regina Wang.
WK15. Vertex Cover and Approximation Algorithm By Lin, Jr-Shiun Choi, Jae Sung.
CS270 Project Overview Maximum Planar Subgraph Danyel Fisher Jason Hong Greg Lawrence Jimmy Lin.
1 Convex Recoloring of Trees Reuven Bar-Yehuda Ido Feldman.
The Manhattan Tourist Problem Shane Wood 4/29/08 CS 329E.
GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,
Spanning tree Lecture 4.
CPS Computational problems, algorithms, runtime, hardness (a ridiculously brief introduction to theoretical computer science) Vincent Conitzer.
Algorithms for hard problems Parameterized complexity – definitions, sample algorithms Juris Viksna, 2015.
1 Approximation algorithms Algorithms and Networks 2015/2016 Hans L. Bodlaender Johan M. M. van Rooij TexPoint fonts used in EMF. Read the TexPoint manual.
Kernel Bounds for Path and Cycle Problems Bart M. P. Jansen Joint work with Hans L. Bodlaender & Stefan Kratsch September 8 th 2011, Saarbrucken.
BITS Pilani Pilani Campus Data Structure and Algorithms Design Dr. Maheswari Karthikeyan Lecture1.
The geometric GMST problem with grid clustering Presented by 楊劭文, 游岳齊, 吳郁君, 林信仲, 萬高維 Department of Computer Science and Information Engineering, National.
CS 721 Project Implementation of Hypergraph Edge Covering Algorithms By David Leung ( )
Complexity Classes.
Mathematical Foundations of AI
Hard Problems Some problems are hard to solve.
Hans Bodlaender, Marek Cygan and Stefan Kratsch
An introduction to Approximation Algorithms Presented By Iman Sadeghi
Approximate Algorithms (chap. 35)
Hamiltonian Cycle and TSP
Hamiltonian Cycle and TSP
Lecture 22 Complexity and Reductions
Design and Analysis of Algorithm
Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight Bart M. P. Jansen June 4th, WORKER 2015, Nordfjordeid, Norway.
Intro to NP Completeness
Clustered representations: Clusters, covers, and partitions
Connected Components Minimum Spanning Tree
Finding Subgraphs with Maximum Total Density and Limited Overlap
Subtree Isomorphism in O(n2.5)
Introduction to Algorithms Second Edition by
Problem Solving 4.
Complexity Theory in Practice
Presentation transcript:

On efficient fixed-parameter algorithms for weighted vertex cover By Rolf Niedermeier & Peter Rossmanith Presentation by Peerapol Bhuaratnarunkon April 29 th, 2004

Overview Unweighted Vertex Cover (UVC) Weighted Vertex Cover (WVC) Integer-WVC Real-WVC Dynamic Programming

Unweighted Vertex Cover O( k +kn) by Chen et al. - “Vertex folding” O( k +kn) by Niedermeier and Rossmanith - “Dynamic Programming”

Weighted Vertex Cover find a vertex cover with total weight less than or equal to k 3 Variants of WVC Integer-WVC, Real-WVC, General-WVC,

Integer-WVC Can be solved as fast as UVC Only additive term polynomial in k 1.) Branch at all vertices whose weight is at least 6 Branching vector (1,6) Branching number is good enough to compete the best UVC algorithm

Integer-WVC (con’t) 2.) Transform Integer-WVC to UVC Integer-WVC(G, k) iff UVC(G’, k) Let t(k,n) be time to solve UVC For UVC of a cluster instance, t(k,wn)=O(t(k,kn)) where w=O(1) i, weight 3 j, weight 1 WVC instance UVC instance cluster i’ cluster j’

Real-WVC 1) If no vertex with degree > 2, use Linear time dynamic programming* 2.1) If there is a vertex of degree > 4, branch on the vertex Branching vector (1,4) or better 2.2) If there is a degree-1 vertex* Branching vector (1,4) – or better

Real-WVC (con’t) 2.3) If there is triangle* Branching vector (3,4,3) – or better 2.4) If there is no triangle* Branching vector (3,4,3) – or better Can be solved in time O( k +kn)

Dynamic Programming Reduce exponential running time Use exponential space Store all induced subgraphs of size βk vertices in database Solve them & Store optimal solutions if size at most βk/2 Branching can stop earlier when size of search tree is as small as βk/2

Dynamic Programming (con’t) Apply to UVC Can’t directly apply to the fastest algorithm of Chen et al. Apply to the 2 nd fastest algorithm of Niedermeier et al. Achieve running time O( k +kn) Use O(1.275 k +kn) space So, Integer-UVC can be solved equally fast

Dynamic Programming (con’t) Apply to Real-WVC Achieve running time O( k +kn) Use O(1.363 k +kn) space

Reference R. Niedermeier and P. Rossmanith. On efficient fixed-parameter algorithms for weighted vertex cover. In Journal of Algorithms 47, pages 63-77, Thank you !