Show simple item record

A Bottom-Up Method and Fast Algorithms for max independent set

dc.contributor.authorBourgeois, Nicolas
dc.contributor.authorEscoffier, Bruno
HAL ID: 5124
dc.contributor.authorPaschos, Vangelis
dc.date.accessioned2010-09-13T10:42:52Z
dc.date.available2010-09-13T10:42:52Z
dc.date.issued2010
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/4757
dc.language.isoenen
dc.subjectExact Algorithmsen
dc.subjectMax Independent Seten
dc.subjectBottom-Up Methoden
dc.subject.ddc003en
dc.titleA Bottom-Up Method and Fast Algorithms for max independent seten
dc.typeCommunication / Conférence
dc.description.abstractenWe first propose a new method, called “bottom-up method”, that, informally, “propagates” improvement of the worst-case complexity for “sparse” instances to “denser” ones and we show an easy though non-trivial application of it to the min set cover problem. We then tackle max independent set. Following the bottom-up method we propagate improvements of worst-case complexity from graphs of average degree d to graphs of average degree greater than d. Indeed, using algorithms for max independent set in graphs of average degree 3, we tackle max independent set in graphs of average degree 4, 5 and 6. Then, we combine the bottom-up technique with measure and conquer techniques to get improved running times for graphs of maximum degree 4, 5 and 6 but also for general graphs. The best computation bounds obtained for max independent set are O *(1.1571 n ), O *(1.1918 n ) and O *(1.2071 n ), for graphs of maximum (or more generally average) degree 4, 5 and 6 respectively, and O *(1.2127 n ) for general graphs. These results improve upon the best known polynomial space results for these cases.en
dc.identifier.citationpages62-73en
dc.relation.ispartofseriestitleLecture Notes in Computer Science
dc.relation.ispartofseriesnumber6139
dc.relation.ispartoftitle12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedingsen
dc.relation.ispartofeditorKaplan, Haim
dc.relation.ispartofpublnameSpringeren
dc.relation.ispartofpublcityBerlinen
dc.relation.ispartofdate2010
dc.relation.ispartofpages450en
dc.relation.ispartofurlhttp://dx.doi.org/10.1007/978-3-642-13731-0en
dc.relation.isversionofdoihttp://dx.doi.org/10.1007/978-3-642-13731-0_7
dc.description.sponsorshipprivateouien
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.ispartofisbn978-3-642-13730-3en
dc.relation.conftitle12th Scandinavian Symposium and Workshops on Algorithm Theory - SWAT'10en
dc.relation.confdate2010-06
dc.relation.confcityBergenen
dc.relation.confcountryNorvègeen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record