A general method to speed up fixed-parameter-tractable algorithms

A fixed-parameter-tractable algorithm, or FPT algorithm for short, gets an instance (I,k) as its input and has to decide whether (I,k)∈ L for some parameterized problem L . Many parameterized algorithms work in two stages: reduction to a problem kernel and bounded search tree. Their time complexity...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 73; číslo 3; s. 125 - 129
Hlavní autoři: Niedermeier, Rolf, Rossmanith, Peter
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 29.02.2000
Elsevier Science
Témata:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer science; control theory; systems
Decision theory. Utility theory
Exact sciences and technology
Operational research and scientific management
Operational research. Management science
Parameterized complexity
Theoretical computing
Parameterized complexity
Algorithms
Parmetrized complexity
Reduction to problem kernel
Fixed parameter tractable algorithm
Search tree
Acceleration
Algorithm
Computational complexity
Time complexity
ISSN:0020-0190, 1872-6119
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract A fixed-parameter-tractable algorithm, or FPT algorithm for short, gets an instance (I,k) as its input and has to decide whether (I,k)∈ L for some parameterized problem L . Many parameterized algorithms work in two stages: reduction to a problem kernel and bounded search tree. Their time complexity is then of the form O(p(|I|)+q(k)ξ k) , where q(k) is the size of the problem kernel. We show how to modify these algorithms to obtain time complexity O(p(|I|)+ξ k) , if q(k) is polynomial.
AbstractList A fixed-parameter-tractable algorithm, or FPT algorithm for short, gets an instance (I,k) as its input and has to decide whether (I,k)∈ L for some parameterized problem L . Many parameterized algorithms work in two stages: reduction to a problem kernel and bounded search tree. Their time complexity is then of the form O(p(|I|)+q(k)ξ k) , where q(k) is the size of the problem kernel. We show how to modify these algorithms to obtain time complexity O(p(|I|)+ξ k) , if q(k) is polynomial.
Author Niedermeier, Rolf
Rossmanith, Peter
Author_xml – sequence: 1
  givenname: Rolf
  surname: Niedermeier
  fullname: Niedermeier, Rolf
  organization: Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076 Tübingen, Germany
– sequence: 2
  givenname: Peter
  surname: Rossmanith
  fullname: Rossmanith, Peter
  email: rossmani@informatic.tu-muenchen.de
  organization: Institut für Informatik, Technische Universität München, Arcisstr. 21, D-80290 München, Germany
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1297024$$DView record in Pascal Francis
BookMark eNqFkE1LAzEQhoNUsK3-BGEPHvQQnWyyH8GDFPELBA_qOWST2Tay3V2SKPrvTa148NIhMIc878vwzMikH3ok5JjBOQNWXjwD5ECBSTgFOIM0grI9MmV1ldOSMTkh0z_kgMxCeEtMKXg1JYtFtsQeve6yNcbVYLM4ZGFEtNn7mLXuEy0dtdfpEz2NXpuomw4z3S0H7-JqHQ7Jfqu7gEe_e05eb29eru_p49Pdw_XikRrOy0iblunWFrzRtWF5Y3htWsGaojG1FYUFYXNhKyllrrmVVcmRc5CiKWooqrywfE5Otr2jDkZ3rde9cUGN3q21_1IslxXkImGXW8z4IQSPrTIu6uiGPh3vOsVAbaSpH2lqY0TB5iVpiqV08S_9178jd7XNYTLw4dCrYBz2Bq3zaKKyg9vR8A3vP4UV
CODEN IFPLAT
CitedBy_id crossref_primary_10_1016_S0196_6774_03_00005_1
crossref_primary_10_1145_1233481_1233493
crossref_primary_10_1007_s10878_015_9969_4
crossref_primary_10_1006_jagm_2000_1141
crossref_primary_10_1016_S0022_0000_03_00074_6
crossref_primary_10_1007_s00453_025_01312_0
crossref_primary_10_1016_j_jda_2006_12_008
crossref_primary_10_1016_j_tcs_2009_05_006
crossref_primary_10_1016_S1570_8667_03_00009_1
crossref_primary_10_1007_s00224_007_9032_7
crossref_primary_10_1016_j_ic_2013_08_006
crossref_primary_10_1007_s11390_005_0003_7
crossref_primary_10_1016_j_jda_2012_04_005
crossref_primary_10_1016_j_ipl_2020_105998
crossref_primary_10_1007_s00224_008_9150_x
crossref_primary_10_1016_j_jcss_2004_03_007
crossref_primary_10_1016_j_jcss_2011_07_001
crossref_primary_10_1016_j_tcs_2010_06_026
crossref_primary_10_1016_j_tcs_2011_11_040
crossref_primary_10_1002_net_20081
crossref_primary_10_1016_j_ipl_2007_10_007
crossref_primary_10_1016_j_jcss_2003_09_003
crossref_primary_10_1016_S0022_0000_03_00076_X
crossref_primary_10_1016_j_tcs_2009_08_033
crossref_primary_10_1089_cmb_2009_0166
crossref_primary_10_1137_050646354
crossref_primary_10_1007_s00224_009_9165_y
crossref_primary_10_1007_s00224_010_9262_y
crossref_primary_10_1137_090767285
crossref_primary_10_1007_s10878_011_9391_5
crossref_primary_10_1016_j_ipl_2004_10_003
crossref_primary_10_1287_opre_2019_1970
crossref_primary_10_1007_s00453_012_9619_5
crossref_primary_10_1007_s00453_012_9663_1
crossref_primary_10_1007_s10878_014_9733_1
crossref_primary_10_1006_jagm_2001_1186
crossref_primary_10_1145_2071379_2071386
crossref_primary_10_1007_s00453_014_9874_8
crossref_primary_10_1007_s10878_012_9565_9
Cites_doi 10.1016/S0168-0072(95)00020-8
10.1016/S0020-0190(97)00213-5
ContentType Journal Article
Copyright 2000
2000 INIST-CNRS
Copyright_xml – notice: 2000
– notice: 2000 INIST-CNRS
DBID AAYXX
CITATION
IQODW
DOI 10.1016/S0020-0190(00)00004-1
DatabaseName CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EISSN 1872-6119
EndPage 129
ExternalDocumentID 1297024
10_1016_S0020_0190_00_00004_1
S0020019000000041
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29I
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABEFU
ABFNM
ABFSI
ABJNI
ABMAC
ABTAH
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
AEBSH
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
E.L
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HLZ
HMJ
HVGLF
HZ~
IHE
J1W
KOM
LG9
M26
M41
MO0
MS~
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SEW
SME
SPC
SPCBC
SSV
SSZ
T5K
TN5
UQL
WH7
WUQ
XPP
ZMT
ZY4
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
ID FETCH-LOGICAL-c336t-bf1afd53ba8c12bc38cf41b5bc8d45d04d24d79992a3d9763e33094b5805725d3
ISICitedReferencesCount 79
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000085848300008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-0190
IngestDate Mon Jul 21 09:16:09 EDT 2025
Tue Nov 18 22:02:42 EST 2025
Sat Nov 29 02:29:44 EST 2025
Fri Feb 23 02:28:02 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Parameterized complexity
Algorithms
Parmetrized complexity
Reduction to problem kernel
Fixed parameter tractable algorithm
Search tree
Acceleration
Algorithm
Computational complexity
Time complexity
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c336t-bf1afd53ba8c12bc38cf41b5bc8d45d04d24d79992a3d9763e33094b5805725d3
PageCount 5
ParticipantIDs pascalfrancis_primary_1297024
crossref_citationtrail_10_1016_S0020_0190_00_00004_1
crossref_primary_10_1016_S0020_0190_00_00004_1
elsevier_sciencedirect_doi_10_1016_S0020_0190_00_00004_1
PublicationCentury 2000
PublicationDate 2000-02-29
PublicationDateYYYYMMDD 2000-02-29
PublicationDate_xml – month: 02
  year: 2000
  text: 2000-02-29
  day: 29
PublicationDecade 2000
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Information processing letters
PublicationYear 2000
Publisher Elsevier B.V
Elsevier Science
Publisher_xml – name: Elsevier B.V
– name: Elsevier Science
References Downey, Fellows (ID009) 1999
Greene, Knuth (ID012) 1982
Niedermeier, Rossmanith (ID014) 1999
Niedermeier, Rossmanith (ID015) 1999; Vol. 1563
Cai, Chen, Downey, Fellows (ID006) 1997; Vol. 84
Fernau, Niedermeier (ID011) 1999; Vol. 1672
Balasubramanian, Fellows, Raman (ID005) 1998; Vol. 65
Chen, Kanj, Jia (ID007) 1999
Niedermeier (ID013) 1998; Vol. 1521
Downey, Fellows (ID008) 1995
Stege, Fellows (ID016) 1999
Downey, Fellows, Stege (ID010) 1999; Vol. 49
Niedermeier (10.1016/S0020-0190(00)00004-1_ID013) 1998; Vol. 1521
Cai (10.1016/S0020-0190(00)00004-1_ID006) 1997; Vol. 84
Downey (10.1016/S0020-0190(00)00004-1_ID010) 1999; Vol. 49
Downey (10.1016/S0020-0190(00)00004-1_ID008) 1995
Balasubramanian (10.1016/S0020-0190(00)00004-1_ID005) 1998; Vol. 65
Downey (10.1016/S0020-0190(00)00004-1_ID009) 1999
Niedermeier (10.1016/S0020-0190(00)00004-1_ID015) 1999; Vol. 1563
Chen (10.1016/S0020-0190(00)00004-1_ID007) 1999
Stege (10.1016/S0020-0190(00)00004-1_ID016) 1999
Niedermeier (10.1016/S0020-0190(00)00004-1_ID014) 1999
Fernau (10.1016/S0020-0190(00)00004-1_ID011) 1999; Vol. 1672
Greene (10.1016/S0020-0190(00)00004-1_ID012) 1982
References_xml – year: 1999
  ident: ID014
  article-title: An efficient fixed parameter algorithm for 3-Hitting Set
– year: 1982
  ident: ID012
  publication-title: Mathematics for the Analysis of Algorithms, 2nd edn.
– volume: Vol. 1563
  start-page: 561
  year: 1999
  end-page: 570
  ident: ID015
  article-title: Upper bounds for Vertex Cover further improved
  publication-title: Proc. 16th Symposium on Theoretical Aspects of Computer Science
– start-page: 219
  year: 1995
  end-page: 244
  ident: ID008
  article-title: Parameterized computational feasibility
  publication-title: Feasible Mathematics II
– year: 1999
  ident: ID016
  article-title: An improved fixed-parameter-tractable algorithm for Vertex Cover
– year: 1999
  ident: ID009
  article-title: Parameterized Complexity
– volume: Vol. 1521
  start-page: 168
  year: 1998
  end-page: 185
  ident: ID013
  article-title: Some prospects for efficient fixed parameter algorithms
  publication-title: Proc. 25th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM)
– volume: Vol. 65
  start-page: 163
  year: 1998
  end-page: 168
  ident: ID005
  article-title: An improved fixed parameter algorithm for vertex cover
  publication-title: Inform. Process. Lett.
– volume: Vol. 49
  start-page: 49
  year: 1999
  end-page: 100
  ident: ID010
  article-title: Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability
  publication-title: Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future
– year: 1999
  ident: ID007
  article-title: Vertex cover: Further observations and further improvements
  publication-title: Proc. 25th International Workshop on Graph-Theoretic Concepts in Computer Science, Ascona, Switzerland
– volume: Vol. 84
  start-page: 119
  year: 1997
  end-page: 138
  ident: ID006
  article-title: Advice classes of parameterized tractability
  publication-title: Ann. Pure Appl. Logic
– volume: Vol. 1672
  start-page: 387
  year: 1999
  end-page: 397
  ident: ID011
  article-title: An efficient exact algorithm for constraint bipartite vertex cover
  publication-title: Proc. 24th Conference on Mathematical Foundations of Computer Science, Szklarsk Poreba, Poland
– volume: Vol. 84
  start-page: 119
  year: 1997
  ident: 10.1016/S0020-0190(00)00004-1_ID006
  article-title: Advice classes of parameterized tractability
  publication-title: Ann. Pure Appl. Logic
  doi: 10.1016/S0168-0072(95)00020-8
– start-page: 219
  year: 1995
  ident: 10.1016/S0020-0190(00)00004-1_ID008
  article-title: Parameterized computational feasibility
– volume: Vol. 65
  start-page: 163
  issue: 3
  year: 1998
  ident: 10.1016/S0020-0190(00)00004-1_ID005
  article-title: An improved fixed parameter algorithm for vertex cover
  publication-title: Inform. Process. Lett.
  doi: 10.1016/S0020-0190(97)00213-5
– volume: Vol. 1672
  start-page: 387
  year: 1999
  ident: 10.1016/S0020-0190(00)00004-1_ID011
  article-title: An efficient exact algorithm for constraint bipartite vertex cover
– volume: Vol. 49
  start-page: 49
  year: 1999
  ident: 10.1016/S0020-0190(00)00004-1_ID010
  article-title: Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability
– volume: Vol. 1521
  start-page: 168
  year: 1998
  ident: 10.1016/S0020-0190(00)00004-1_ID013
  article-title: Some prospects for efficient fixed parameter algorithms
– year: 1999
  ident: 10.1016/S0020-0190(00)00004-1_ID014
– year: 1999
  ident: 10.1016/S0020-0190(00)00004-1_ID007
  article-title: Vertex cover: Further observations and further improvements
– year: 1999
  ident: 10.1016/S0020-0190(00)00004-1_ID009
– year: 1999
  ident: 10.1016/S0020-0190(00)00004-1_ID016
– volume: Vol. 1563
  start-page: 561
  year: 1999
  ident: 10.1016/S0020-0190(00)00004-1_ID015
  article-title: Upper bounds for Vertex Cover further improved
– year: 1982
  ident: 10.1016/S0020-0190(00)00004-1_ID012
SSID ssj0006437
Score 1.8473463
Snippet A fixed-parameter-tractable algorithm, or FPT algorithm for short, gets an instance (I,k) as its input and has to decide whether (I,k)∈ L for some...
SourceID pascalfrancis
crossref
elsevier
SourceType Index Database
Enrichment Source
Publisher
StartPage 125
SubjectTerms Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer science; control theory; systems
Decision theory. Utility theory
Exact sciences and technology
Operational research and scientific management
Operational research. Management science
Parameterized complexity
Theoretical computing
Title A general method to speed up fixed-parameter-tractable algorithms
URI https://dx.doi.org/10.1016/S0020-0190(00)00004-1
Volume 73
WOSCitedRecordID wos000085848300008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: AIEXJ
  dateStart: 19950113
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fq9MwFA6664Mg_hZ_XcmDD8qItk3aJo9FK3fCneIm7K2kaaOT2ZW1k_35njRpe1Uu0wdhlJEtPZBzevIlPV8-hJ7ziDMVSY9IWHwQpkVMhPIZoUKyIFA64pp3YhPxfM5XK_HR1c83nZxAXFX8cBD1f3U1tIGzDXX2H9w93BQa4Ds4Ha7gdrj-leMTo4psdpqcOrRBl00Nk9R0X0_1-lAWxJz3_d3UwZDWkKQ69pTcfNnu1u1Xd3r5t77CfWA3TmvLKTB7C5uOBDTA8fksfZt-Ok9nrqxieIvzYbE4T-az5dnIJOt3GLyOsT3msYH64rLNxXQamKo2q_fZp1OrTOLCpqfw2OzoW46zm2h9a-OPHG63ExbDzQFpG8Fq0S1niD9OXP3L-t_ms6HKEAzEAEGuopMgDgWfoJNklq7eDxO1eWdpK4CsoZHg9Xq0_sLzXjrLl0GXG7Vs4IHSVgnlAjxZ3kY33boCJzYe7qArZXUX3XJrDOzGtIGmXsajb7uHkgS7iME2YnC7xV3E4H2NL40YPEbMffT5Xbp8c0acsgZRlEYtybUvdRHSXHLlB7miXGnm52GueMHCwmNFwIoY1g6BpAUAVlpS6gmWhxzgfRAW9AGaVNuqfIiwyBnTMg5YDn8QHpc60DzkANsjJaLcf4RYP2iZcsfOG_WTTTbWF8JYZ2asM898YKwz6PZq6Fbbc1eOdeC9RzIHHi0ozCCujnU9_cWDo0EbQI-P_P4EXR8fm6do0u725Sm6pn6062b3zEXdT7ILjr4
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+general+method+to+speed+up+fixed-parameter-tractable+algorithms&rft.jtitle=Information+processing+letters&rft.au=NIEDERMEIER%2C+R&rft.au=ROSSMANITH%2C+P&rft.date=2000-02-29&rft.pub=Elsevier+Science&rft.issn=0020-0190&rft.volume=73&rft.issue=3-4&rft.spage=125&rft.epage=129&rft_id=info:doi/10.1016%2FS0020-0190%2800%2900004-1&rft.externalDBID=n%2Fa&rft.externalDocID=1297024
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon