On the public citation graph
A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths
0 signed · 49 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/bf02523685openalex-snapshot
Primal-dual approximation algorithms for integral flow and multicut in trees
inferredcites →https://doi.org/10.1007/s00453-001-0068-9openalex-snapshot
Optimal Time-Critical Scheduling via Resource Augmentation
inferredcites →https://doi.org/10.1007/s00453-005-1172-zopenalex-snapshot
Combinatorial Algorithms for the Unsplittable Flow Problem
inferredcites →https://doi.org/10.1007/s00453-006-1210-5openalex-snapshot
Approximation Algorithms for the Unsplittable Flow Problem
inferredcites →https://doi.org/10.1007/s10951-006-5593-6openalex-snapshot
On the Complexity of Adjacent Resource Scheduling
inferredcites →https://doi.org/10.1016/0095-8956(75)90089-1openalex-snapshot
Three short proofs in graph theory
inferredcites →https://doi.org/10.1016/0166-218x(87)90037-0openalex-snapshot
Scheduling jobs with fixed start and end times
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/0377-2217(84)90053-5openalex-snapshot
Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses
inferredcites →https://doi.org/10.1016/j.tcs.2010.08.028openalex-snapshot
Resource allocation with time intervals
inferredcites →https://doi.org/10.1016/s0304-3975(98)00336-3openalex-snapshot
Fast stabbing of boxes in high dimensions
inferredcites →https://doi.org/10.1016/s0925-7721(98)00028-5openalex-snapshot
Label placement by maximum independent set in rectangles
inferredcites →https://doi.org/10.1080/07408170208928886openalex-snapshot
Allocation of bandwidth and storage
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/502102.502107openalex-snapshot
A unified approach to approximating resource allocation and scheduling
inferredcites →https://doi.org/10.1287/moor.25.2.255.12228openalex-snapshot
Approximation Algorithms for Disjoint Paths and Related Routing 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.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-75409-8_16openalex-snapshot
The Parameterized Complexity Landscape of the Unsplittable Flow Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-93112-3_3openalex-snapshot
On the Approximability of Unsplittable Flow on a Path with Time Windows
inferred← citeshttps://doi.org/10.1007/978-3-319-33461-5_28openalex-snapshot
Submodular Unsplittable Flow on Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-58253-5_19openalex-snapshot
Matheuristics for the Temporal Bin Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_79openalex-snapshot
A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_11openalex-snapshot
General Caching Is Hard: Even with Small Pages
inferred← citeshttps://doi.org/10.1007/s00224-021-10048-7openalex-snapshot
Fixed-Parameter Algorithms for Unsplittable Flow Cover
inferred← citeshttps://doi.org/10.1007/s00453-016-0137-8openalex-snapshot
A Constant Factor Approximation Algorithm for the Storage Allocation Problem
inferred← citeshttps://doi.org/10.1007/s10107-017-1218-4openalex-snapshot
Submodular unsplittable flow on trees
inferred← citeshttps://doi.org/10.1007/s10107-021-01755-7openalex-snapshot
Approximation algorithms for the generalized incremental knapsack problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.12.036openalex-snapshot
An iterative dynamic programming approach for the temporal knapsack problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.03.027openalex-snapshot
Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.01.008openalex-snapshot
Solving the Temporal Knapsack Problem via Recursive Dantzig–Wolfe Reformulation
inferred← citeshttps://doi.org/10.1016/j.orl.2022.12.001openalex-snapshot
A knapsack intersection hierarchy
inferred← citeshttps://doi.org/10.1051/ro/2015010openalex-snapshot
The Prize-collecting Call Control Problem on Weighted Lines and Rings
inferred← citeshttps://doi.org/10.1109/focs.2013.50openalex-snapshot
Approximation Schemes for Maximum Weight Independent Set of Rectangles
inferred← citeshttps://doi.org/10.1109/noms.2016.7502799openalex-snapshot
Protecting virtual networks with DRONE
inferred← citeshttps://doi.org/10.1109/opcs59592.2023.10275324openalex-snapshot
A Heuristic Algorithm for the Temporal Knapsack Problem
inferred← citeshttps://doi.org/10.1109/tcomm.2019.2954410openalex-snapshot
Virtual Network Embedding With Guaranteed Connectivity Under Multiple Substrate Link Failures
inferred← citeshttps://doi.org/10.1109/tkde.2016.2590435openalex-snapshot
Mutually Beneficial Confluent Routing
inferred← citeshttps://doi.org/10.1137/1.9781611976465.54openalex-snapshot
Coloring and Maximum Weight Independent Set of Rectangles
inferred← citeshttps://doi.org/10.1142/s0129054123460012openalex-snapshot
The B-Prize-Collecting Multicut Problem in Paths, Spider Graphs and Rings
inferred← citeshttps://doi.org/10.1145/3188745.3188894openalex-snapshot
A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes
inferred← citeshttps://doi.org/10.1145/3242769openalex-snapshot
A Mazing 2+ε Approximation for Unsplittable Flow on a Path
inferred← citeshttps://doi.org/10.1145/3519935.3519959openalex-snapshot
A PTAS for unsplittable flow on a path
inferred← citeshttps://doi.org/10.1145/3798129.3800912openalex-snapshot
Improved Approximation Algorithms for Non-preemptive Throughput Maximization
inferred← citeshttps://doi.org/10.1145/3820880openalex-snapshot
A (2 + ε )-Approximation Algorithm for Maximum Independent Set of Rectangles
inferred← citeshttps://doi.org/10.23919/ifipnetworking52078.2021.9472812openalex-snapshot
Containers Resource Allocation in Dynamic Cloud Environments
inferred← citeshttps://doi.org/10.2991/icwcsn-16.2017.96openalex-snapshot
Discrete Particle Swarm Optimization Algorithms for the Prize-Collecting Call Control Problem on Lines
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.86openalex-snapshot
Breaking the Barrier of 2 for the Storage Allocation Problem
inferred← citeshttps://doi.org/10.70675/b550f24az9877z4b62za52az5ab3579afa6aopenalex-snapshot
Aggregation and disaggregation of integer linear programs
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.