On the public citation graph
Primal-dual schema for capacitated covering problems
0 signed · 38 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.1007/978-3-540-68891-4_20openalex-snapshot
Primal-Dual Schema for Capacitated Covering Problems
inferredcites →https://doi.org/10.1007/978-3-540-72792-7_34openalex-snapshot
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities
inferredcites →https://doi.org/10.1007/s10107-008-0228-7openalex-snapshot
Single item lot-sizing with non-decreasing capacities
inferredcites →https://doi.org/10.1016/0196-6774(81)90020-1openalex-snapshot
A linear-time approximation algorithm for the weighted vertex cover problem
inferredcites →https://doi.org/10.1016/j.jcss.2005.06.004openalex-snapshot
An improved approximation algorithm for vertex cover with hard capacities
inferredcites →https://doi.org/10.1137/s0097539703422479openalex-snapshot
Covering Problems with Hard Capacities
inferredcites →https://doi.org/10.1137/s0097539792236237openalex-snapshot
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
inferredcites →https://doi.org/10.1137/s0097539793242618openalex-snapshot
A General Approximation Technique for Constrained Forest Problems
inferredcites →https://doi.org/10.1145/1367064.1367074openalex-snapshot
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
inferredcites →https://doi.org/10.1145/502102.502107openalex-snapshot
A unified approach to approximating resource allocation and scheduling
inferredcites →https://doi.org/10.1287/moor.1050.0178openalex-snapshot
Primal-Dual Algorithms for Deterministic Inventory Problems
inferredcites →https://doi.org/10.1287/moor.20.3.562openalex-snapshot
Capacitated Facility Location: Valid Inequalities and Facets
inferredcites →https://doi.org/10.1287/moor.26.2.339.10552openalex-snapshot
Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing 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/opre.33.4.842openalex-snapshot
Valid Linear Inequalities for Fixed Charge Problems
inferredcites →https://doi.org/10.1287/opre.46.4.503openalex-snapshot
From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-58453-4_2openalex-snapshot
Linear Online Incentive Mechanism Design: Case Study of Crowdsensing with Random Task Arrivals
inferred← citeshttps://doi.org/10.1007/978-3-319-51469-7_11openalex-snapshot
Economic Lot-Sizing Problem with Remanufacturing Option: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/s00186-018-0629-1openalex-snapshot
A fast algorithm for the rectilinear distance location problem
inferred← citeshttps://doi.org/10.1007/s00224-026-10260-3openalex-snapshot
Minimum-Cost Mixed Graph Covers with Targeted Weight Constraints
inferred← citeshttps://doi.org/10.1007/s00453-017-0363-8openalex-snapshot
A Note on Submodular Function Minimization with Covering Type Linear Constraints
inferred← citeshttps://doi.org/10.1007/s10878-023-01027-4openalex-snapshot
Precedence-constrained covering problems with multiplicity constraints
inferred← citeshttps://doi.org/10.1007/s40305-023-00488-yopenalex-snapshot
Approximation Algorithms for Solving the k-Chinese Postman Problem Under Interdiction Budget Constraints
inferred← citeshttps://doi.org/10.1016/j.dam.2017.08.024openalex-snapshot
An approximation algorithm for the partial covering 0–1 integer program
inferred← citeshttps://doi.org/10.1016/j.esd.2019.01.007openalex-snapshot
Cost allocation for rural electrification using game theory: A case of distributed generation in rural India
inferred← citeshttps://doi.org/10.1016/j.orl.2017.07.002openalex-snapshot
Greedy algorithms for the single-demand facility location problem
inferred← citeshttps://doi.org/10.1016/j.orl.2019.12.006openalex-snapshot
Easy capacitated facility location problems, with connections to lot-sizing
inferred← citeshttps://doi.org/10.1109/icc.2017.7997118openalex-snapshot
Efficient auction mechanisms for two-layer vehicle-to-grid energy trading in smart grid
inferred← citeshttps://doi.org/10.1109/icc.2018.8422306openalex-snapshot
An Online Mechanism for Crowdsensing with Uncertain Task Arriving
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218654openalex-snapshot
A truthful incentive mechanism for emergency demand response in colocation data centers
inferred← citeshttps://doi.org/10.1109/jiot.2020.2964657openalex-snapshot
An Online Incentive Mechanism for Crowdsensing With Random Task Arrivals
inferred← citeshttps://doi.org/10.1137/1.9781611976465.179openalex-snapshot
Non-uniform Geometric Set Cover and Scheduling on Multiple Machines
inferred← citeshttps://doi.org/10.1137/21m1459964openalex-snapshot
A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems
inferred← citeshttps://doi.org/10.1287/msom.2019.0832openalex-snapshot
Online Advance Scheduling with Overtime: A Primal-Dual Approach
inferred← citeshttps://doi.org/10.14778/3407790.3407818openalex-snapshot
Fast subtrajectory similarity search in road networks under weighted edit distance constraints
inferred← citeshttps://doi.org/10.15807/jorsj.60.15openalex-snapshot
A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH
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.