Multiplicative Parameterization Above a Guarantee

DOI10.1145/3460956MaRDI QIDQ5868879zbMATH OpenOpenAlexFDO

Authors Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Publication date 24 September 2022

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3460956

zbMATH Keywords

above-guaranteegirthlong cyclemultiplicative above-guaranteeparameterized complexity

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27)

Recommendations

• Parameterization Above a Multiplicative Guarantee
• scientific article; zbMATH DE number 4101580
• Bounds for multiplicities
• Multiplicity and tight closures of parameters
• scientific article; zbMATH DE number 2085258
• Parameterizing above or below guaranteed values
• A note on the multiplier conjecture
• A strengthened Mulholland-type inequality with parameters
• On the multiplier conjecture
• Optimality of a Polynomial Multiplier

Cited in

(4)

• Detours in directed graphs
• Methods for determining cycles of a specific length in undirected graphs with edge weights
• Approximating long cycle above Dirac's guarantee
• A fast algorithm for maximum satisfiability above half number of clauses

This page was built for publication: Multiplicative Parameterization Above a Guarantee

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5868879)