Mixing color coding-related techniques

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

50 Scopus citations

Abstract

Narrow sieves, representative sets and divide-and-color are three breakthrough techniques related to color coding, which led to the design of extremely fast parameterized algorithms. We present a novel family of strategies for applying mixtures of them. This includes: (a) a mix of representative sets and narrow sieves; (b) a faster computation of representative sets under certain separateness conditions, mixed with divide-and-color and a new technique, called “balanced cutting”; (c) two mixtures of representative sets and a new technique, called “unbalanced cutting”. We demonstrate our strategies by obtaining, among other results, significantly faster algorithms for k-Internal Out-Branching and Weighted 3-Set k-Packing, and a general framework for speedingup the previous best deterministic algorithms for k-Path, k-Tree, r- Dimensional k-Matching, Graph Motif and Partial Cover.

Original languageEnglish
Title of host publicationAlgorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings
EditorsNikhil Bansal, Irene Finocchi
PublisherSpringer Verlag
Pages1037-1049
Number of pages13
ISBN (Print)9783662483497
DOIs
StatePublished - 1 Jan 2015
Externally publishedYes
Event23rd European Symposium on Algorithms, ESA 2015 - Patras, Greece
Duration: 14 Sep 201516 Sep 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9294
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference23rd European Symposium on Algorithms, ESA 2015
Country/TerritoryGreece
CityPatras
Period14/09/1516/09/15

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Mixing color coding-related techniques'. Together they form a unique fingerprint.

Cite this