Parameterized Approximation Algorithms for Hitting Set

Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/62034

Title:	Parameterized Approximation Algorithms for Hitting Set
Contributor(s):	Brankovic, Ljiljana (author) ; Fernau, Hening (author)
Publication Date:	2012
DOI:	10.1007/978-3-642-29116-6_6
Handle Link:	https://hdl.handle.net/1959.11/62034
Abstract:	We are going to analyze simple search tree algorithms for approximating d-Hitting Set, focussing on the case of factor-2 approximations for d = 3. We also derive several results for hypergraph instances of bounded degree, including a new polynomial-time approximation.
Publication Type:	Conference Publication
Conference Details:	WAOA 2011: 9th International Workshop on Approximation and Online Algorithms, Saarbrücken, Germany, 8th -9th September, 2011
Source of Publication:	Approximation and Online Algorithms, p. 63-76
Publisher:	Springer Berlin, Heidelberg
Place of Publication:	Germany
Fields of Research (FoR) 2020:	461305 Data structures and algorithms
Socio-Economic Objective (SEO) 2020:	220499 Information systems, technologies and services not elsewhere classified
Peer Reviewed:	Yes
HERDC Category Description:	E1 Refereed Scholarly Conference Publication
Series Name:	Lecture Notes in Computer Science
Series Number :	7164
Appears in Collections:	Conference Publication School of Science and Technology

2 files

File	Description	Size	Format

Show full item record

13

checked on Jan 25, 2025

Check

Research UNE