On the public citation graph

Approximation algorithms for covering/packing integer programs

https://doi.org/10.1016/j.jcss.2005.05.002

0 signed · 100 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-21708-5_16openalex-snapshot

Approximation Algorithms

inferredcites →https://doi.org/10.1007/bf01580440openalex-snapshot

Facets of the knapsack polytope

inferredcites →https://doi.org/10.1007/bf01580441openalex-snapshot

Faces for a linear inequality in 0–1 variables

inferredcites →https://doi.org/10.1007/bf01580442openalex-snapshot

Facet of regular 0–1 polytopes

inferredcites →https://doi.org/10.1007/bf02579324openalex-snapshot

Randomized rounding: A technique for provably good algorithms and algorithmic proofs

inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot

Approximation Algorithms

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/0097-3165(73)90005-8openalex-snapshot

On a combinatorial game

inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot

Approximation algorithms for combinatorial problems

inferredcites →https://doi.org/10.1016/s0166-218x(02)00598-xopenalex-snapshot

Approximating covering integer programs with multiplicity constraints

inferredcites →https://doi.org/10.1109/focs.2004.4openalex-snapshot

Proceedings. 45th Annual IEEE Symposium on Foundations of Computer Science

inferredcites →https://doi.org/10.1109/sfcs.1993.366855openalex-snapshot

Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs

inferredcites →https://doi.org/10.1109/sfcs.2001.959928openalex-snapshot

Tight approximation results for general covering integer programs

inferredcites →https://doi.org/10.1137/0603059openalex-snapshot

On the Greedy Heuristic for Continuous Covering and Packing Problems

inferredcites →https://doi.org/10.1137/1.9781611970074openalex-snapshot

Ten Lectures on the Probabilistic Method

inferredcites →https://doi.org/10.1137/1.9781611970203openalex-snapshot

An Algorithmic Theory of Numbers, Graphs and Convexity

inferredcites →https://doi.org/10.1137/s0097539792237462openalex-snapshot

Optimal File Sharing in Distributed Networks

inferredcites →https://doi.org/10.1137/s0097539796314240openalex-snapshot

Improved Approximation Guarantees for Packing and Covering Integer Programs

inferredcites →https://doi.org/10.1137/s0097539798335596openalex-snapshot

A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria

inferredcites →https://doi.org/10.1145/258533.258641openalex-snapshot

A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

inferredcites →https://doi.org/10.1145/261342.571216openalex-snapshot

Approximation Algorithms for NP-Hard Problems

inferredcites →https://doi.org/10.1145/3618260openalex-snapshot

Proceedings of the 56th Annual ACM Symposium on Theory of Computing

inferredcites →https://doi.org/10.1145/800125.804034openalex-snapshot

Approximation algorithms for combinatorial problems

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.1287/moor.4.3.233openalex-snapshot

A Greedy Heuristic for the Set-Covering Problem

inferredcites →https://doi.org/10.1287/moor.7.4.515openalex-snapshot

Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data

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.2139/ssrn.4469947openalex-extracted

A Space Efficient Algorithm for Multiset Multicover with Multiplicity Constraints Problem

inferred← citeshttps://doi.org/10.1002/rsa.20964openalex-snapshot

Partial resampling to approximate covering integer programs†

inferred← citeshttps://doi.org/10.1007/978-3-030-04618-7_6openalex-snapshot

A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem

inferred← citeshttps://doi.org/10.1007/978-3-030-20518-8_63openalex-snapshot

The Problems of Selecting Problems

inferred← citeshttps://doi.org/10.1007/978-3-030-92702-8_15openalex-snapshot

Precedence-Constrained Covering Problems with Multiplicity Constraints

inferred← citeshttps://doi.org/10.1007/978-3-031-15714-1_6openalex-snapshot

On Improved Interval Cover Mechanisms for Crowdsourcing Markets

inferred← citeshttps://doi.org/10.1007/978-3-031-22832-2_17openalex-snapshot

Auditing for Core Stability in Participatory Budgeting

inferred← citeshttps://doi.org/10.1007/978-3-031-32726-1_23openalex-snapshot

Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques

inferred← citeshttps://doi.org/10.1007/978-3-031-81396-2_1openalex-snapshot

Bounding the Price-of-Fair-Sharing Using Knapsack-Cover Constraints to Guide Near-Optimal Cost-Recovery Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-032-28691-8_30openalex-snapshot

Structure-Preserving Symmetry Presolving for Mixed-Binary Linear Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_53openalex-snapshot

Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost

inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_4openalex-snapshot

Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs

inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_8openalex-snapshot

Approximability of Sparse Integer Programs

inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_6openalex-snapshot

Exact Algorithms for Set Multicover and Multiset Multicover Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_27openalex-snapshot

On Column-Restricted and Priority Covering Integer Programs

inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_37openalex-snapshot

Approximating Sparse Covering Integer Programs Online

inferred← citeshttps://doi.org/10.1007/978-3-642-38016-7_3openalex-snapshot

Online Multi-Commodity Flow with High Demands

inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_41openalex-snapshot

Approximate Deadline-Scheduling with Precedence Constraints

inferred← citeshttps://doi.org/10.1007/978-981-96-1093-8_23openalex-snapshot

A Space Efficient Algorithm for Multiset Multicover with Multiplicity Constraints Problem via Algebraic Method

inferred← citeshttps://doi.org/10.1007/s00446-011-0127-7openalex-snapshot

Distributed algorithms for covering, packing and maximum weighted matching

inferred← citeshttps://doi.org/10.1007/s00453-010-9431-zopenalex-snapshot

Approximability of Sparse Integer Programs

inferred← citeshttps://doi.org/10.1007/s00453-012-9629-3openalex-snapshot

Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost

inferred← citeshttps://doi.org/10.1007/s00453-022-00987-zopenalex-snapshot

Approximation Algorithms for Cost-robust Discrete Minimization Problems Based on their LP-Relaxations

inferred← citeshttps://doi.org/10.1007/s00453-022-01059-yopenalex-snapshot

Few Cuts Meet Many Point Sets

inferred← citeshttps://doi.org/10.1007/s00453-024-01234-3openalex-snapshot

Online Multiset Submodular Cover

inferred← citeshttps://doi.org/10.1007/s10107-019-01388-xopenalex-snapshot

Stochastic packing integer programs with few queries

inferred← citeshttps://doi.org/10.1007/s10115-017-1079-4openalex-snapshot

On mining approximate and exact fault-tolerant frequent itemsets

inferred← citeshttps://doi.org/10.1007/s10878-012-9558-8openalex-snapshot

Mobile facility location: combinatorial filtering via weighted occupancy

inferred← citeshttps://doi.org/10.1007/s10878-016-0005-0openalex-snapshot

Approximation algorithm for partial positive influence problem in social network

inferred← citeshttps://doi.org/10.1007/s10878-016-0066-0openalex-snapshot

Local ratio method on partial set multi-cover

inferred← citeshttps://doi.org/10.1007/s10878-022-00874-xopenalex-snapshot

Algorithms for covering multiple submodular constraints and applications

inferred← citeshttps://doi.org/10.1007/s10878-023-01027-4openalex-snapshot

Precedence-constrained covering problems with multiplicity constraints

inferred← citeshttps://doi.org/10.1016/j.artint.2018.10.001openalex-snapshot

Computing a small agreeable set of indivisible items

inferred← citeshttps://doi.org/10.1016/j.cviu.2008.06.005openalex-snapshot

Limited view CT reconstruction and segmentation via constrained metric labeling

inferred← citeshttps://doi.org/10.1016/j.ejor.2016.06.068openalex-snapshot

Lower bounds and algorithms for the minimum cardinality bin covering problem

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.02.016openalex-snapshot

Dynamic programming based algorithms for set multicover and multiset multicover problems

inferred← citeshttps://doi.org/10.1016/j.tcs.2019.03.004openalex-snapshot

A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.01.017openalex-snapshot

Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting

inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115654openalex-snapshot

On generalizations of partial scenario set cover

inferred← citeshttps://doi.org/10.1109/access.2023.3262653openalex-snapshot

DATM: A Novel Data Agnostic Topic Modeling Technique With Improved Effectiveness for Both Short and Long Text

inferred← citeshttps://doi.org/10.1109/asonam.2016.7752288openalex-snapshot

Detecting misinformation in online social networks before it is too late

inferred← citeshttps://doi.org/10.1109/cec.2016.7748345openalex-snapshot

Automatic media planning: Optimal advertisement placement problems

inferred← citeshttps://doi.org/10.1109/infocom.2018.8486429openalex-snapshot

Joint Placement and Routing of Network Function Chains in Data Centers

inferred← citeshttps://doi.org/10.1109/ipdpsw.2018.00176openalex-snapshot

Using Activity Patterns to Place Electric Vehicle Charging Stations in Urban Regions

inferred← citeshttps://doi.org/10.1109/tmc.2020.3023757openalex-snapshot

Optimizing Mobile Crowdsensing Platforms for Boundedly Rational Users

inferred← citeshttps://doi.org/10.1109/tnsm.2025.3559104openalex-snapshot

Joint Controller Placement and TDMA Scheduling in Software Defined Wireless Multihop Networks

inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch139openalex-snapshot

Partial Resampling to Approximate Covering Integer Programs

inferred← citeshttps://doi.org/10.1137/1.9781611975031.25openalex-snapshot

Randomized MWU for Positive LPs

inferred← citeshttps://doi.org/10.1137/1.9781611975482.97openalex-snapshot

On Approximating (Sparse) Covering Integer Programs

inferred← citeshttps://doi.org/10.1145/1217856.1217860openalex-snapshot

An approximation scheme for stochastic linear programming and its application to stochastic integer programs

inferred← citeshttps://doi.org/10.1145/1582716.1582746openalex-snapshot

Distributed and parallel algorithms for weighted vertex cover and other covering problems

inferred← citeshttps://doi.org/10.1145/1644893.1644905openalex-snapshot

Detecting traffic differentiation in backbone ISPs with NetPolice

inferred← citeshttps://doi.org/10.1145/3802126openalex-snapshot

Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation

inferred← citeshttps://doi.org/10.1184/r1/6603581openalex-snapshot

Approximating Sparse Covering Integer Programs Online

inferred← citeshttps://doi.org/10.1186/s13015-016-0073-9openalex-snapshot

An exact algorithm for finding cancer driver somatic genome alterations: the weighted mutually exclusive maximum set cover problem

inferred← citeshttps://doi.org/10.1287/moor.2014.0652openalex-snapshot

Approximating Sparse Covering Integer Programs Online

inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11799openalex-snapshot

Graph Scan Statistics With Uncertainty

inferred← citeshttps://doi.org/10.1613/jair.4621openalex-snapshot

Weighted Electoral Control

inferred← citeshttps://doi.org/10.24963/ijcai.2017/48openalex-snapshot

Computing an Approximately Optimal Agreeable Set of Items

inferred← citeshttps://doi.org/10.33774/miir-2023-tkf3copenalex-snapshot

Optimal configuration for communication antenna along a railway line

inferred← citeshttps://doi.org/10.4086/toc.2007.v004a003openalex-snapshot

inferred← citeshttps://doi.org/10.4086/toc.2008.v004a003openalex-snapshot

inferred← citeshttps://doi.org/10.4086/toc.2022.v018a007openalex-snapshot

inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2019.23openalex-snapshot

Fast and Deterministic Approximations for $k$-Cut

inferred← citeshttps://doi.org/10.48550/arxiv.1201.5030openalex-snapshot

Online Multi-Commodity Flow with High Demands

inferred← citeshttps://doi.org/10.48550/arxiv.1302.5820openalex-snapshot

An exact algorithm with the time complexity of $O^*(1.299^m)$ for the weighed mutually exclusive set cover problem

inferred← citeshttps://doi.org/10.48550/arxiv.1401.6385openalex-snapshot

An exact algorithm for the weighed mutually exclusive maximum set cover problem

inferred← citeshttps://doi.org/10.48550/arxiv.1507.00748openalex-snapshot

Approximate Deadline-Scheduling with Precedence Constraints

inferred← citeshttps://doi.org/10.48550/arxiv.1907.04413openalex-snapshot

On Approximating Partial Set Cover and Generalizations

inferred← citeshttps://doi.org/10.48550/arxiv.1912.11103openalex-snapshot

A near-linear time minimum Steiner cut algorithm for planar graphs

inferred← citeshttps://doi.org/10.5555/2095116.2095241openalex-snapshot

Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling

inferred← citeshttps://doi.org/10.5555/2484920.2484980openalex-snapshot

Weighted electoral control

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.