A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem

DOI10.1007/978-3-540-73545-8_35zbMATH Open1185.68363OpenAlexW1577302089MaRDI QIDQ3608860FDOQ3608860

Jianer Chen, Jianxin Wang, Yunlong Liu

Publication date: 6 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_35

Recommendations

• On counting 3-D matchings of size \(k\)
• On Counting Parameterized Matching and Packing
• Parameterized counting matching and packing: a family of hard problems that admit FPTRAS
• Approximate counting of matchings in \((3,3)\)-hypergraphs
• scientific article; zbMATH DE number 1979521

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Approximation algorithms (68W25) Asymptotic enumeration (05A16) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (2)

• The \(k\)-distinct language: parameterized automata constructions
• On counting 3-D matchings of size \(k\)

This page was built for publication: A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem

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