1. Research UNE
  2. UNE
  3. Conference Publication
Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/62034
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBrankovic, Ljiljanaen
dc.contributor.authorFernau, Heningen
local.source.editorEditor(s): Roberto Solis-Oba and Giuseppe Persianoen
dc.date.accessioned2024-08-08T04:20:04Z-
dc.date.available2024-08-08T04:20:04Z-
dc.date.issued2012-
dc.identifier.citationApproximation and Online Algorithms, p. 63-76en
dc.identifier.isbn9783642291166en
dc.identifier.isbn9783642291159en
dc.identifier.urihttps://hdl.handle.net/1959.11/62034-
dc.description.abstract<p>We are going to analyze simple search tree algorithms for approximating <i>d</i>-Hitting Set, focussing on the case of factor-2 approximations for <i>d</i> = 3. We also derive several results for hypergraph instances of bounded degree, including a new polynomial-time approximation.</p>en
dc.languageenen
dc.publisherSpringer Berlin, Heidelbergen
dc.relation.ispartofApproximation and Online Algorithmsen
dc.relation.ispartofseriesLecture Notes in Computer Scienceen
dc.titleParameterized Approximation Algorithms for Hitting Seten
dc.typeConference Publicationen
dc.relation.conferenceWAOA 2011: 9th International Workshop on Approximation and Online Algorithmsen
dc.identifier.doi10.1007/978-3-642-29116-6_6en
local.contributor.firstnameLjiljanaen
local.contributor.firstnameHeningen
local.profile.schoolSchool of Science and Technologyen
local.profile.emaillbrankov@une.edu.auen
local.output.categoryE1en
local.record.placeauen
local.record.institutionUniversity of New Englanden
local.date.conference8th -9th September, 2011en
local.conference.placeSaarbrücken, Germanyen
local.publisher.placeGermanyen
local.format.startpage63en
local.format.endpage76en
local.series.issn1611-3349en
local.series.issn0302-9743en
local.series.number7164en
local.peerreviewedYesen
local.contributor.lastnameBrankovicen
local.contributor.lastnameFernauen
dc.identifier.staffune-id:lbrankoven
local.profile.orcid0000-0002-5056-4627en
local.profile.roleauthoren
local.profile.roleauthoren
local.identifier.unepublicationidune:1959.11/62034en
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
local.title.maintitleParameterized Approximation Algorithms for Hitting Seten
local.output.categorydescriptionE1 Refereed Scholarly Conference Publicationen
local.conference.detailsWAOA 2011: 9th International Workshop on Approximation and Online Algorithms, Saarbrücken, Germany, 8th -9th September, 2011en
local.search.authorBrankovic, Ljiljanaen
local.search.authorFernau, Heningen
local.uneassociationNoen
local.atsiresearchNoen
local.conference.venueSaarbrücken, Germanyen
local.sensitive.culturalNoen
local.year.published2012en
local.fileurl.closedpublishedhttps://rune.une.edu.au/web/retrieve/09c3d6c8-8ee7-469a-b265-786888886d8den
local.subject.for2020461305 Data structures and algorithmsen
local.subject.seo2020220499 Information systems, technologies and services not elsewhere classifieden
local.date.start2011-09-08-
local.date.end2011-09-09-
local.profile.affiliationtypeExternal Affiliationen
local.profile.affiliationtypeExternal Affiliationen
Appears in Collections:Conference Publication
School of Science and Technology
Files in This Item:
2 files
File Description SizeFormat 
Show simple item record

SCOPUSTM   
Citations

13
checked on Jan 25, 2025
Google Media

Google ScholarTM

Check

Altmetric


Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.