NDLI: An 8-approximation algorithm for the subset feedback vertex set problem

Content Provider	IEEE Xplore Digital Library
Author	Even, G. Naor, J.S. Zosin, L.
Copyright Year	1996
Description	Author affiliation: Saarlandes Univ., Saarbrucken, Germany (Even, G.)
Abstract	We present an 8-approximation algorithm for the problem of finding a minimum weight subset feedback vertex set. The input in this problem consists of an undirected graph G=(V,E) with vertex weights w(v) and a subset of vertices S called special vertices. A cycle is called interesting if it contains at least one special vertex. A subset of vertices is called a subset feedback vertex set with respect to S if it intersects every interesting cycle The goal is to find a minimum weight subset feedback vertex set. The best pervious algorithm for the general case provided only a logarithmic approximation factor. The minimum weight subset feedback vertex set problem generalizes two NP-Complete problems: the minimum weight feedback vertex set problem in undirected graphs and the minimum weight multiway vertex cut problem. The main tool that we use in our algorithm and its analysis is a new version of multi-commodity flow which we call relaxed multi-commodity flow. Relaxed multi-commodity flow is a hybrid of multi-commodity flow and multi-terminal flow.
Starting Page	310
Ending Page	319
File Size	1060081
Page Count	10
File Format	PDF
ISBN	0818675942
ISSN	02725428
DOI	10.1109/SFCS.1996.548490
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1996-10-14
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	NP-complete problem Computer science Approximation algorithms State feedback Joining processes Genetics Couplings Algorithm design and analysis
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem (1996)

An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem

Compression-Based Fixed-Parameter Algorithms for Feedback Vertex Set and Edge Bipartization (2006)

Compression-Based Fixed-Parameter Algorithms for Feedback Vertex Set and Edge Bipartization (2006)

An Approximation Algorithm for Feedback Vertex Sets in Tournaments

Enumerating minimal subset feedback vertex sets.

Parallelization of scheduling algorithms

Algorithms for Single-Source Vertex Connectivity

An Algorithm for Minimum Feedback Vertex Set Problem on a Trapezoid Graph

An 8-approximation algorithm for the subset feedback vertex set problem

Similar Documents

An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem (1996)

An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem

Compression-Based Fixed-Parameter Algorithms for Feedback Vertex Set and Edge Bipartization (2006)

Compression-Based Fixed-Parameter Algorithms for Feedback Vertex Set and Edge Bipartization (2006)

An Approximation Algorithm for Feedback Vertex Sets in Tournaments

Enumerating minimal subset feedback vertex sets.

Parallelization of scheduling algorithms

Algorithms for Single-Source Vertex Connectivity

An Algorithm for Minimum Feedback Vertex Set Problem on a Trapezoid Graph

An 8-approximation algorithm for the subset feedback vertex set problem