On the public citation graph

A Space Efficient Algorithm for Multiset Multicover with Multiplicity Constraints Problem

https://doi.org/10.2139/ssrn.4469947
0 signed · 10 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-662-04616-6_4openalex-extracted
Approximation Algorithms
inferredcites →https://doi.org/10.1016/j.jcss.2005.05.002openalex-extracted
Approximation algorithms for covering/packing integer programs
inferredcites →https://doi.org/10.1016/j.tcs.2009.05.020openalex-extracted
Set multi-covering via inclusion–exclusion
inferredcites →https://doi.org/10.1016/j.tcs.2010.02.016openalex-extracted
Dynamic programming based algorithms for set multicover and multiset multicover problems
inferredcites →https://doi.org/10.1016/s0166-218x(02)00598-xopenalex-extracted
Approximating covering integer programs with multiplicity constraints
inferredcites →https://doi.org/10.1137/070683933openalex-extracted
Set Partitioning via Inclusion-Exclusion
inferredcites →https://doi.org/10.1137/s0097539793260763openalex-extracted
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
inferredcites →https://doi.org/10.1137/s0097539796314240openalex-extracted
Improved Approximation Guarantees for Packing and Covering Integer Programs
inferredcites →https://doi.org/10.1145/1250790.1250801openalex-extracted
Fourier meets möbius: fast subset convolution
inferredcites →https://doi.org/10.5555/365411.365535openalex-extracted
New approaches to covering and packing problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.