On the public citation graph

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems

https://doi.org/10.1007/pl00009203
0 signed · 26 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/bf01787474openalex-snapshot
Transversal numbers of uniform hypergraphs
inferredcites →https://doi.org/10.1016/0022-0000(88)90003-7openalex-snapshot
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
inferredcites →https://doi.org/10.1016/0097-3165(76)90001-7openalex-snapshot
Resource constrained scheduling as generalized bin packing
inferredcites →https://doi.org/10.1016/0166-218x(81)90022-6openalex-snapshot
“Integer-making” theorems
inferredcites →https://doi.org/10.1016/0166-218x(91)90087-dopenalex-snapshot
Improved bounds for harmonic-based bin packing algorithms
inferredcites →https://doi.org/10.1016/0166-218x(94)90036-1openalex-snapshot
On some geometric methods in scheduling theory: a survey
inferredcites →https://doi.org/10.1016/0196-6774(84)90004-xopenalex-snapshot
On a dual version of the one-dimensional bin packing problem
inferredcites →https://doi.org/10.1016/0196-6774(91)90001-fopenalex-snapshot
Probabilistic analysis of algorithms for dual bin packing problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.2001.3087openalex-snapshot
Online Variable Sized Covering
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_52openalex-snapshot
On-Line Variable Sized Covering
inferred← citeshttps://doi.org/10.1007/bfb0029568openalex-snapshot
On-line packing and covering problems
inferred← citeshttps://doi.org/10.1007/bfb0053962openalex-snapshot
Approximation schemes for covering and scheduling in related machines
inferred← citeshttps://doi.org/10.1007/s10479-018-2762-xopenalex-snapshot
Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
inferred← citeshttps://doi.org/10.1007/s10951-018-0590-0openalex-snapshot
Lower bounds for online bin covering-type problems
inferred← citeshttps://doi.org/10.1007/s11590-025-02213-5openalex-snapshot
Exact combinatorial algorithms for solving the bin covering problems with strong divisibility and rejection profit
inferred← citeshttps://doi.org/10.1016/j.cosrev.2016.12.001openalex-snapshot
Approximation and online algorithms for multidimensional bin packing: A survey
inferred← citeshttps://doi.org/10.1016/j.dam.2010.04.005openalex-snapshot
On the sum minimization version of the online bin covering problem
inferred← citeshttps://doi.org/10.1016/j.dam.2013.03.020openalex-snapshot
Bin covering with cardinality constraints
inferred← citeshttps://doi.org/10.1016/j.disopt.2018.03.001openalex-snapshot
The skiving stock problem and its relation to hypergraph matchings
inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106430openalex-snapshot
There is no APTAS for 2-dimensional vector bin packing: Revisited
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00179-8openalex-snapshot
There is no asymptotic PTAS for two-dimensional vector packing
inferred← citeshttps://doi.org/10.1080/02331934.2018.1494171openalex-snapshot
Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00033openalex-snapshot
Almost Optimal Inapproximability of Multidimensional Packing Problems
inferred← citeshttps://doi.org/10.1137/s0097539799356265openalex-snapshot
On Multidimensional Packing Problems
inferred← citeshttps://doi.org/10.15480/882.2882openalex-snapshot
Solving Packing Problems with Few Small Items Using Rainbow Matchings
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2023.65openalex-snapshot
Almost Optimal Inapproximability of Multidimensional 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.