scientific article; zbMATH DE number 6687769

DOI10.4230/LIPICS.FSTTCS.2013.237MaRDI QIDQ2963917zbMATH OpenFDO

Authors Prachi Goyal, Neeldhara Misra, Fahad Panolan

Publication date 21 February 2017

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2013.237

zbMATH Keywords

3-dimensional matchingfixed-parameter algorithmsiterative expansion

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Recommendations

• Deterministic algorithms for matching and packing problems based on representative sets
• Efficient computation of representative sets with applications in parameterized and exact algorithms
• Faster algorithms for semi-matching problems (extended abstract)
• Faster algorithms for semi-matching problems
• Combinatorial Pattern Matching
• On the complexity of approximating \(k\)-dimensional matching
• Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory
• Faster and simpler approximation of stable matchings
• Faster and simpler approximation of stable matchings
• Fast algorithms for some dominating induced matching problems

Cited in

(4)

• Using nondeterminism to design efficient deterministic algorithms
• Deterministic algorithms for matching and packing problems based on representative sets
• Mixing Color Coding-Related Techniques
• scientific article; zbMATH DE number 2081099 (Why is no real title available?)

This page was built for publication:

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