Circulant graphs and GCD and LCM of subsets

DOI10.1016/J.IPL.2014.07.014MaRDI QIDQ477605zbMATH OpenOpenAlexFDO

Authors Joachim von zur Gathen, Igor E. Shparlinski

Publication date 9 December 2014

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

Full work available at URL https://arxiv.org/abs/1402.5449

zbMATH Keywords

computational complexityanalysis of algorithmsgraph algorithmscirculant graphsminimum cover

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number-theoretic algorithms; complexity (11Y16)

Abstract: Given two sets $A$ and $B$ of integers, we consider the problem of finding a set $SsubseteqA$ of the smallest possible cardinality such the greatest common divisor of the elements of $ScupB$ equals that of those of $AcupB$. The particular cases of $B=emptyset$ and $$ are of special interest and have some links with graph theory. We also consider the corresponding question for the least common multiple of the elements. We establish NP-completeness and approximation results for these problems by relating them to the Minimum Cover Problem.

Recommendations

• scientific article; zbMATH DE number 1113848
• scientific article; zbMATH DE number 1109404
• Greatest common divisors and least common multiples of graphs
• scientific article; zbMATH DE number 4139776
• scientific article; zbMATH DE number 799777

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 918133 (Why is no real title available?)
• Algorithmic construction of sets for k -restrictions
• Approximation algorithms for combinatorial problems
• Editing graphs to satisfy degree constraints: a parameterized approach
• Factoring into coprimes in essentially linear time
• Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
• The parameterized complexity of editing graphs for bounded degeneracy

Cited in

(1)

• An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\))

This page was built for publication: Circulant graphs and GCD and LCM of subsets

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