NP-hardness of \(m\)-dimensional weighted matching problems

DOI10.1016/j.tcs.2022.07.008OpenAlexW4285607150MaRDI QIDQ2166755

Gábor Kondor

Publication date: 25 August 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.07.008

zbMATH Keywords

complexitypartitionmatchingbalanced clustering

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Exact algorithms for size constrained 2-clustering in the plane
• On the complexity of some quadratic Euclidean 2-clustering problems
• An empirical comparison of heuristic methods for creating maximally diverse groups
• A class of bounded approximation algorithms for graph partitioning
• One-Half Approximation Algorithms for the k-Partition Problem
• Design of balanced MBA student teams
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: NP-hardness of \(m\)-dimensional weighted matching problems