Some algorithmic results for [2]-sumset covers

DOI10.1016/J.IPL.2014.07.008zbMATH Open1366.68088OpenAlexW2149527532MaRDI QIDQ458372FDOQ458372

Authors: Laurent Bulteau, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette 

Publication date: 7 October 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.07.008

Recommendations

• On Finding Small 2-Generating Sets
• Approximating min sum set cover
• scientific article; zbMATH DE number 1947050
• On the equal-subset-sum problem
• scientific article; zbMATH DE number 426337

zbMATH Keywords

algorithmcomplexitysumset cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05)

Cites Work

• Additive combinatorics
• Title not available (Why is that?)
• Sets in \(\mathbb{Z}_n\) with distinct sums of pairs.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimum sum covers of small cyclic groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of variations of equal sum subsets
• On the representation of 1,2,..., n by sums
• A Postage Stamp Problem
• On Finding Small 2-Generating Sets
• A note on the postage stamp problem
• Representing powers of numbers as subset sums of small sets
• On optimal subset representations of integer sets
• Nonnegative integral subset representations of integer sets
• The minimum substring cover problem

Cited In (2)

• Optimal monomial quadratization for ODE systems
• On Finding Small 2-Generating Sets

This page was built for publication: Some algorithmic results for [2]-sumset covers

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