On the public citation graph
Minimum Cost Resource Allocation for Meeting Job Requirements
0 signed · 34 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/3-540-47867-1_28openalex-snapshot
Improved Approximation Algorithms for Resource Allocation
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot
Reducibility Among Combinatorial Problems
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/s00453-006-1210-5openalex-snapshot
Approximation Algorithms for the Unsplittable Flow Problem
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.1109/ipdps.2010.5470347openalex-snapshot
Varying bandwidth resource allocation problem with bag constraints
inferredcites →https://doi.org/10.1137/1.9781611973068.77openalex-snapshot
A logarithmic approximation for unsplittable flow on line graphs
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.1145/1132516.1132617openalex-snapshot
A quasi-PTAS for unsplittable flow on line graphs
inferredcites →https://doi.org/10.1145/1273340.1273343openalex-snapshot
Multicommodity demand flow in a tree and packing integer programs
inferredcites →https://doi.org/10.1145/1721837.1721856openalex-snapshot
Optimization problems in multiple-interval graphs
inferredcites →https://doi.org/10.1145/321906.321909openalex-snapshot
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
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.4.3.233openalex-snapshot
A Greedy Heuristic for the Set-Covering Problem
inferredcites →https://doi.org/10.1287/moor.4.4.339openalex-snapshot
Fast Approximation Algorithms for Knapsack 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
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2010.181openalex-snapshot
A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints
inferredcites →https://doi.org/10.5555/1496770.1496847openalex-snapshot
A logarithmic approximation for unsplittable flow on line graphs
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-1-4614-8970-2_2openalex-snapshot
Optimal Resource Rental Management
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_46openalex-snapshot
Resource Allocation for Covering Time Varying Demands
inferred← citeshttps://doi.org/10.1007/s11590-017-1209-7openalex-snapshot
Easy knapsacks and the complexity of energy allocation problems in the smart grid
inferred← citeshttps://doi.org/10.1016/j.jnca.2015.01.001openalex-snapshot
An integrated task computation and data management scheduling strategy for workflow applications in cloud environments
inferred← citeshttps://doi.org/10.1051/ro/2017035openalex-snapshot
Resource allocation problem under single resource assignment
inferred← citeshttps://doi.org/10.1109/focs.2011.10openalex-snapshot
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
inferred← citeshttps://doi.org/10.1109/ipdps.2012.77openalex-snapshot
Optimal Resource Rental Planning for Elastic Applications in Cloud Market
inferred← citeshttps://doi.org/10.1109/tcc.2015.2464799openalex-snapshot
Exploring Fine-Grained Resource Rental Planning in Cloud Computing
inferred← citeshttps://doi.org/10.1109/tpds.2018.2836452openalex-snapshot
Minimal Cost Server Configuration for Meeting Time-Varying Resource Demands in Cloud Centers
inferred← citeshttps://doi.org/10.1145/3077839.3077841openalex-snapshot
Crowd-Sourced Storage-Assisted Demand Response in Microgrids
inferred← citeshttps://doi.org/10.14279/depositonce-14497openalex-snapshot
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
inferred← citeshttps://doi.org/10.14279/depositonce-3602openalex-snapshot
Hybrid Solving Techniques for Project Scheduling Problems
inferred← citeshttps://doi.org/10.18535/ijecs/v5i3.25openalex-snapshot
Variants of Resource Allocation Problem
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.