On the public citation graph
https://doi.org/10.4086/toc.2012.v008a024
0 signed · 75 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.1006/jagm.2000.1155openalex-snapshot
Greedy Local Improvement and Weighted Set Packing Approximation
inferredcites →https://doi.org/10.1007/3-540-44985-x_19openalex-snapshot
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs
inferredcites →https://doi.org/10.1007/978-3-642-04128-0_8openalex-snapshot
Approximability of Sparse Integer Programs
inferredcites →https://doi.org/10.1007/978-3-642-13036-6_28openalex-snapshot
On k-Column Sparse Packing Programs
inferredcites →https://doi.org/10.1007/978-3-642-23719-5_66openalex-snapshot
Improved Approximations for k-Exchange Systems
inferredcites →https://doi.org/10.1007/bf01585178openalex-snapshot
An approximation algorithm for the generalized assignment problem
inferredcites →https://doi.org/10.1007/bf01588971openalex-snapshot
An analysis of approximations for maximizing submodular set functions—I
inferredcites →https://doi.org/10.1007/bfb0121195openalex-snapshot
An analysis of approximations for maximizing submodular set functions—II
inferredcites →https://doi.org/10.1007/s00037-006-0205-6openalex-snapshot
On the complexity of approximating k-set packing
inferredcites →https://doi.org/10.1007/s00453-010-9431-zopenalex-snapshot
Approximability of Sparse Integer Programs
inferredcites →https://doi.org/10.1007/s10107-002-0370-6openalex-snapshot
Approximating disjoint-path problems using packing integer programs
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/0166-218x(81)90022-6openalex-snapshot
“Integer-making” theorems
inferredcites →https://doi.org/10.1109/ccc.2009.38openalex-snapshot
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
inferredcites →https://doi.org/10.1109/infcom.2000.832182openalex-snapshot
QoS routing with performance-dependent costs
inferredcites →https://doi.org/10.1137/0402008openalex-snapshot
On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
inferredcites →https://doi.org/10.1137/070680977openalex-snapshot
On Maximizing Welfare When Utility Functions Are Subadditive
inferredcites →https://doi.org/10.1137/080733991openalex-snapshot
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
inferredcites →https://doi.org/10.1137/090750020openalex-snapshot
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
inferredcites →https://doi.org/10.1137/1.9781611973068.60openalex-snapshot
Maximizing Submodular Set Functions Subject to Multiple Linear Constraints
inferredcites →https://doi.org/10.1137/s009753970036917xopenalex-snapshot
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
inferredcites →https://doi.org/10.1137/s0097539700381097openalex-snapshot
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
inferredcites →https://doi.org/10.1137/s0097539796314240openalex-snapshot
Improved Approximation Guarantees for Packing and Covering Integer Programs
inferredcites →https://doi.org/10.1145/1374376.1374389openalex-snapshot
Optimal approximation for the submodular welfare problem in the value oracle model
inferredcites →https://doi.org/10.1145/167088.167211openalex-snapshot
A parallel approximation algorithm for positive linear programming
inferredcites →https://doi.org/10.1145/509907.510017openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1287/moor.23.3.640openalex-snapshot
On Local Search for Weighted k-Set Packing
inferredcites →https://doi.org/10.4230/lipics.stacs.2012.42openalex-snapshot
A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems
inferredcites →https://doi.org/10.5555/1496770.1496830openalex-snapshot
Maximizing submodular set functions subject to multiple linear constraints
inferredcites →https://doi.org/10.5555/365411.365535openalex-snapshot
New approaches to covering and 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.1002/rsa.20964openalex-snapshot
Partial resampling to approximate covering integer programs†
inferred← citeshttps://doi.org/10.1007/978-3-030-01554-1_25openalex-snapshot
Scaling-Up Stackelberg Security Games Applications Using Approximations
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_10openalex-snapshot
$$\ell _1$$-Sparsity approximation bounds for packing integer programs
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_13openalex-snapshot
Approximation Schemes for Packing Problems with $$\ell _p$$-norm Diversity Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-23114-3_17openalex-snapshot
Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank
inferred← citeshttps://doi.org/10.1007/978-3-319-42634-1_4openalex-snapshot
New Results for Network Pollution Games
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-662-47672-7_26openalex-snapshot
Streaming Algorithms for Submodular Function Maximization
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/s10115-017-1079-4openalex-snapshot
On mining approximate and exact fault-tolerant frequent itemsets
inferred← citeshttps://doi.org/10.1016/j.disopt.2020.100611openalex-snapshot
Scheduling split intervals with non-uniform demands
inferred← citeshttps://doi.org/10.1109/ieeeconf67917.2025.11443921openalex-snapshot
PSI3D: Plug-and-Play 3D Stochastic Inference with Slice-wise Latent Diffusion Prior
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/infocom.2019.8737449openalex-snapshot
Service Placement with Provable Guarantees in Heterogeneous Edge Computing Systems
inferred← citeshttps://doi.org/10.1109/twc.2016.2636280openalex-snapshot
Resource Allocation Algorithms Supporting Coexistence of Cognitive Vehicular and IEEE 802.22 Networks
inferred← citeshttps://doi.org/10.1109/twc.2020.2968527openalex-snapshot
A Distributed Framework for Task Offloading in Edge Computing Networks of Arbitrary Topology
inferred← citeshttps://doi.org/10.1109/wiopt.2015.7151105openalex-snapshot
Enabling coexistence of cognitive vehicular networks and IEEE 802.22 networks via optimal resource allocation
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch139openalex-snapshot
Partial Resampling to Approximate Covering Integer Programs
inferred← citeshttps://doi.org/10.1137/1.9781611975482.20openalex-snapshot
Submodular Function Maximization in Parallel via the Multilinear Relaxation
inferred← citeshttps://doi.org/10.1137/1.9781611975482.97openalex-snapshot
On Approximating (Sparse) Covering Integer Programs
inferred← citeshttps://doi.org/10.1137/1.9781611976700.42openalex-snapshot
Predictive Optimization with Zero-Shot Domain Adaptation
inferred← citeshttps://doi.org/10.1137/110839655openalex-snapshot
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
inferred← citeshttps://doi.org/10.1137/15m1033708openalex-snapshot
Primal Beats Dual on Online Packing LPs in the Random-Order Model
inferred← citeshttps://doi.org/10.1145/1993636.1993740openalex-snapshot
Submodular function maximization via the multilinear relaxation and contention resolution schemes
inferred← citeshttps://doi.org/10.1145/2591796.2591810openalex-snapshot
Primal beats dual on online packing LPs in the random-order model
inferred← citeshttps://doi.org/10.1145/2688073.2688086openalex-snapshot
On Multiplicative Weight Updates for Concave and Submodular Function Maximization
inferred← citeshttps://doi.org/10.1145/3355400openalex-snapshot
Algorithms to Approximate Column-sparse Packing Problems
inferred← citeshttps://doi.org/10.1287/moor.2014.0652openalex-snapshot
Approximating Sparse Covering Integer Programs Online
inferred← citeshttps://doi.org/10.14288/1.0401971openalex-snapshot
Online contention resolution schemes for matchings and matroids
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11340openalex-snapshot
Scalable Relaxations of Sparse Packing Constraints: Optimal Biocontrol in Predator-Prey Networks
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33011877openalex-snapshot
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity
inferred← citeshttps://doi.org/10.48550/arxiv.1105.4593openalex-snapshot
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
inferred← citeshttps://doi.org/10.48550/arxiv.1311.2661openalex-snapshot
An Approximate, Efficient Solver for LP Rounding
inferred← citeshttps://doi.org/10.48550/arxiv.1711.02724openalex-snapshot
Algorithms to Approximate Column-Sparse Packing Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1711.04208openalex-snapshot
Practical Scalability for Stackelberg Security Games
inferred← citeshttps://doi.org/10.48550/arxiv.2010.08142openalex-snapshot
Improved Approximation Algorithms for Stochastic-Matching Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2107.07103openalex-snapshot
On Optimal Approximations for $k$-Submodular Maximization via Multilinear Extension
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.