Introduction An FPT algorithm

Nicolas Bousquet

Description

Introduction An FPT algorithm Conclusion Multicut is FPT Nicolas Bousquet Jean Daligault Daniel Marx Igor Razgon Stephan Thomasse STOC 2011 Multicut is FPT

• parameterized complexity


• instance


• fpt algorithm


• time poly


• instance left cuts


• fpt


• fixed parameter

Sujets

• Bousquet
• Parameterized complexity
• Instance

Informations

• Publié par: pefav
• Nombre de lectures: 33
• Langue: English

Extrait

Introduction AnFTPlaogirht C m nolciousn tluMT

Marx

Igor

Nicolas

BousquetnDalJealtD´igaulnaei RazgonSte´phanThomasse´

STOC 2011

Multicut is FPT

citusiPF

tiuc An onInodtr oCcn timhglroPFaT terirame on Pa lusi luM ytixelpmocdez tcuti

3

Introduction Parameterized complexity Multicut

Conclusion

FsTP

An FPT algorithm Reducing the instance Left cuts Two different proofs

1

2

Mcutiulti

Talgorit tion AnFP nIrtdocu explomdczeritemearaP noisulcnoC mh uctluit ti M y nIeret wkretemarapaotno isenerwhn,<< h k itocbmteehnonfi ts C ? losilexporiainat htllorpe lecr A )el blnanteiemblefisd tfehnitshtsezioe orem(Cou ance. The raFediht luit TP M .edbyerizreewthet igoLredr temarap cdinaMohedOoneccS ticuPTsF

FPT A problem parameterized bykisFPT(Fixed Parameter Tractable) iff there is an algorithm which runs in timePoly(n)∙f(k) for an instance of sizenand of parameterk.

FPT