On the public citation graph
Improved parallel approximation of a class of integer programming problems
0 signed · 37 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/rsa.3240030308openalex-snapshot
Simple Constructions of Almost k‐wise Independent Random Variables
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/bf01940874openalex-snapshot
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
inferredcites →https://doi.org/10.1007/bf02122549openalex-snapshot
Optima of dual integer linear programs
inferredcites →https://doi.org/10.1007/bf02579324openalex-snapshot
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
inferredcites →https://doi.org/10.1016/0012-365x(75)90058-8openalex-snapshot
On the ratio of optimal integral and fractional covers
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/0022-0000(93)90033-sopenalex-snapshot
Removing randomness in parallel computation without a processor penalty
inferredcites →https://doi.org/10.1016/s0022-0000(05)80069-8openalex-snapshot
The probabilistic method yields deterministic parallel algorithms
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1103/physrevlett.69.3382openalex-snapshot
Monte Carlo simulations: Hidden errors from ‘‘good’’ random number generators
inferredcites →https://doi.org/10.1109/18.119713openalex-snapshot
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
inferredcites →https://doi.org/10.1109/sfcs.1986.45openalex-snapshot
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
inferredcites →https://doi.org/10.1137/0222053openalex-snapshot
Small-Bias Probability Spaces: Efficient Constructions and Applications
inferredcites →https://doi.org/10.1137/s089548019223872xopenalex-snapshot
Chernoff–Hoeffding Bounds for Applications with Limited Independence
inferredcites →https://doi.org/10.1145/115234.115347openalex-snapshot
Simulating (log c n )-wise independence in NC
inferredcites →https://doi.org/10.1145/167088.167211openalex-snapshot
A parallel approximation algorithm for positive linear programming
inferredcites →https://doi.org/10.1145/174130.174132openalex-snapshot
Randomized algorithms and pseudorandom numbers
inferredcites →https://doi.org/10.1145/195058.195411openalex-snapshot
Improved algorithms via approximations of probability distributions (extended abstract)
inferredcites →https://doi.org/10.1145/225058.225138openalex-snapshot
Improved approximations of packing and covering problems
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
inferredcites →https://doi.org/10.1287/moor.20.2.257openalex-snapshot
Fast Approximation Algorithms for Fractional Packing and Covering Problems
inferredcites →https://doi.org/10.5555/313852.313866openalex-snapshot
An extension of the Lovász local lemma, and its applications to integer programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1999.1695openalex-snapshot
Improved Algorithms via Approximations of Probability Distributions
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_81openalex-snapshot
Packing: Scheduling, Embedding, and Approximating Metrics
inferred← citeshttps://doi.org/10.1007/bfb0058020openalex-snapshot
Solving Some Discrepancy Problems in NC
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.09.018openalex-snapshot
A flow shop scheduling problem with machine-dependent speeds: An ensemble approach with worst-case analysis
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00337-0openalex-snapshot
On the parallel approximability of a subclass of quadratic programming
inferred← citeshttps://doi.org/10.1051/ita:2007032openalex-snapshot
Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming
inferred← citeshttps://doi.org/10.1109/icpads.1997.652589openalex-snapshot
The parallel approximability of a subclass of quadratic programming
inferred← citeshttps://doi.org/10.1137/1.9781611974782.77openalex-snapshot
Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász Local Lemma
inferred← citeshttps://doi.org/10.1137/1.9781611975031.141openalex-snapshot
Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set
inferred← citeshttps://doi.org/10.1137/s0895480199326104openalex-snapshot
Better Approximation Guarantees for Job-Shop Scheduling
inferred← citeshttps://doi.org/10.1242/jeb.048173openalex-snapshot
Optimisation in a natural system: Argentine ants solve the Towers of Hanoi
inferred← citeshttps://doi.org/10.82444/warw.33538555openalex-snapshot
Better approximation guarantees for job-shop scheduling
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.