On the public citation graph

A logarithmic approximation for unsplittable flow on line graphs

https://doi.org/10.1145/2532645
0 signed · 36 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/3-540-45535-3_2openalex-snapshot
Strongly Polynomial Algorithms for the Unsplittable Flow Problem
inferredcites →https://doi.org/10.1007/3-540-45753-4_7openalex-snapshot
Approximation Algorithms for the Unsplittable Flow Problem
inferredcites →https://doi.org/10.1007/978-3-642-03685-9_4openalex-snapshot
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
inferredcites →https://doi.org/10.1007/978-3-662-04565-7openalex-snapshot
Approximation Algorithms
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/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/0304-3975(80)90009-2openalex-snapshot
The directed subgraph homeomorphism problem
inferredcites →https://doi.org/10.1016/j.jalgor.2004.07.006openalex-snapshot
Improved bounds for the unsplittable flow problem
inferredcites →https://doi.org/10.1016/s0022-0000(03)00066-7openalex-snapshot
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
inferredcites →https://doi.org/10.1109/focs.2011.10openalex-snapshot
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
inferredcites →https://doi.org/10.1109/sfcs.1996.548467openalex-snapshot
Short paths in expander graphs
inferredcites →https://doi.org/10.1109/sfcs.1997.646130openalex-snapshot
Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
inferredcites →https://doi.org/10.1109/sfcs.2005.41openalex-snapshot
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
inferredcites →https://doi.org/10.1137/1.9780898714906openalex-snapshot
Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/1.9780898715859openalex-snapshot
Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1145/1132516.1132617openalex-snapshot
A quasi-PTAS for unsplittable flow on line graphs
inferredcites →https://doi.org/10.1145/1183907.1183910openalex-snapshot
Logarithmic hardness of the undirected edge-disjoint paths problem
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/2000807.2000816openalex-snapshot
An improved approximation algorithm for resource allocation
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.25.2.255.12228openalex-snapshot
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
inferredcites →https://doi.org/10.4086/toc.2006.v002a007openalex-snapshot
inferredcites →https://doi.org/10.5555/1496770.1496847openalex-snapshot
A logarithmic approximation for unsplittable flow on line graphs
inferredcites →https://doi.org/10.5555/338219.338631openalex-snapshot
Edge-disjoint paths in expander graphs
inferredcites →https://doi.org/10.5555/338219.338654openalex-snapshot
Off-line admission control for general scheduling 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/s00453-016-0137-8openalex-snapshot
A Constant Factor Approximation Algorithm for the Storage Allocation Problem
inferred← citeshttps://doi.org/10.1007/s10479-022-05054-yopenalex-snapshot
Approximations for generalized unsplittable flow on paths with application to power systems optimization
inferred← citeshttps://doi.org/10.1007/s10951-023-00786-6openalex-snapshot
The preemptive resource allocation problem
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.1145/3210377.3210666openalex-snapshot
Brief Announcement
inferred← citeshttps://doi.org/10.1145/3355400openalex-snapshot
Algorithms to Approximate Column-sparse Packing Problems
inferred← citeshttps://doi.org/10.1145/3452021.3458318openalex-snapshot
Algorithms for a Topology-aware Massively Parallel Computation Model
inferred← citeshttps://doi.org/10.1145/3798129.3800912openalex-snapshot
Improved Approximation Algorithms for Non-preemptive Throughput Maximization
inferred← citeshttps://doi.org/10.3233/jifs-169516openalex-snapshot
Indexing and searching point clouds
inferred← citeshttps://doi.org/10.48550/arxiv.1711.02724openalex-snapshot
Algorithms to Approximate Column-Sparse Packing Problems
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.