Composing equipotent teams.

DOI10.1007/B11926MaRDI QIDQ5900789zbMATH OpenOpenAlexFDO

Authors Mark Cieliebak, Stephan J. Eidenbenz, Aris Pagourtzis

Publication date 20 April 2010

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

Full work available at URL https://doi.org/10.1007/b11926

Mathematics Subject Classification ID

Extremal set theory (05D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the complexity of variations of equal sum subsets
• On the equal-subset-sum problem
• Complexity of the traveling tournament problem
• On the hardness of finding subsets with equal average
• Efficient approximation algorithms for the subset-sums equality problem.

Cited in

(9)

• Subset sum problems with digraph constraints
• Team formation: Matching quality supply and quality demand.
• Faster algorithms for \(k\)-subset sum and variations
• Approximation schemes for subset-sums ratio problems
• Approximating subset sum ratio via subset sum computations
• Simple FPTAS for the subset-sums ratio problem
• Equal-subset-sum faster than the meet-in-the-middle
• Faster algorithms for \(k\)-\textsc{Subset Sum} and variations
• Approximating subset sum ratio via partition computations

This page was built for publication: Composing equipotent teams.

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