On counting 3-D matchings of size \(k\)

DOI10.1007/s00453-008-9207-xzbMath1185.68364OpenAlexW1980552233MaRDI QIDQ1040648

Jianxin Wang, Yunlong Liu, Jian'er Chen

Publication date: 25 November 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9207-x

zbMATH Keywords

approximation algorithmrandomized algorithmcounting complexityparameterized algorithm3-D matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Asymptotic enumeration (05A16) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

Parameterized counting matching and packing: a family of hard problems that admit FPTRAS ⋮ On Counting Parameterized Matching and Packing

Cites Work

• The complexity of computing the permanent
• A faster parameterized algorithm for set packing
• The Complexity of Counting in Sparse, Regular, and Planar Graphs
• Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
• Monte-Carlo approximation algorithms for enumeration problems
• The Complexity of Enumeration and Reliability Problems
• Color-coding
• The Parameterized Complexity of Counting Problems
• Algorithms – ESA 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On counting 3-D matchings of size \(k\)