Almost optimum -covering of Z_n

DOI10.1007/978-981-96-1090-7_39MaRDI QIDQ6970704zbMATH OpenFDO

Authors Ke Shi, Chao Xu

Publication date 17 June 2025

Full work available at URL https://doi.org/10.1007/978-981-96-1090-7_39

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A near-linear pseudopolynomial time algorithm for subset sum
• A simple near-linear pseudopolynomial time randomized algorithm for subset sum
• Codes Correcting Single Errors of Limited Magnitude
• Covering Sets for Limited-Magnitude Errors
• Fast and simple modular subset sum
• Fast modular subset sum using linear sketching
• Faster Pseudopolynomial Time Algorithms for Subset Sum
• scientific article; zbMATH DE number 1542664 (Why is no real title available?)
• scientific article; zbMATH DE number 7069721 (Why is no real title available?)
• scientific article; zbMATH DE number 7740931 (Why is no real title available?)
• Improved Approximation Guarantees for Packing and Covering Integer Programs
• Linear covering codes and error-correcting codes for limited-magnitude errors
• On covering by translates of a set
• On covering sets for limited-magnitude errors
• On the ratio of optimal integral and fractional covers
• Trajectory Codes for Flash Memory
• Two combinatorial covering theorems

This page was built for publication: Almost optimum \(\ell \)-covering of \(\mathbb{Z}_n\)

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