Pages that link to "Item:Q2931432"

The following pages link to A quasi-PTAS for unsplittable flow on line graphs (Q2931432):

Displaying 39 items.

• An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph (Q477619) (← links)
• A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
• Improving LTL truck load utilization on line (Q531465) (← links)
• Resource allocation with time intervals (Q606987) (← links)
• Caching is hard -- even in the fault model (Q692624) (← links)
• Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
• Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
• Resource allocation in bounded degree trees (Q1024215) (← links)
• Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
• Flexible bandwidth assignment with application to optical networks (Q1617285) (← links)
• Complex-demand scheduling problem with application in smart grid (Q1727389) (← links)
• How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
• Submodular unsplittable flow on trees (Q1801021) (← links)
• Flexible resource allocation to interval jobs (Q1999968) (← links)
• Scheduling split intervals with non-uniform demands (Q2218651) (← links)
• Approximation algorithms for the ring loading problem with penalty cost (Q2350601) (← links)
• General caching is hard: even with small pages (Q2408914) (← links)
• Approximations for generalized unsplittable flow on paths with application to power systems optimization (Q2678593) (← links)
• Improved algorithms for scheduling unsplittable flows on paths (Q2684488) (← links)
• Approximation algorithms for the generalized incremental knapsack problem (Q2687039) (← links)
• Fixed-parameter algorithms for unsplittable flow cover (Q2701069) (← links)
• Pricing on paths: a PTAS for the highway problem (Q2796210) (← links)
• The prize-collecting call control problem on weighted lines and rings (Q2798111) (← links)
• Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand (Q2806071) (← links)
• A near-linear time constant factor algorithm for unsplittable flow problem on line with bag constraints (Q2908848) (← links)
• Scheduling Resources for Throughput Maximization (Q3088087) (← links)
• Submodular Unsplittable Flow on Trees (Q3186514) (← links)
• A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)
• Resource allocation problem under single resource assignment (Q4553878) (← links)
• Improved Algorithm for Resource Allocation Problems (Q4604919) (← links)
• (Q4633882) (← links)
• Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice (Q5031618) (← links)
• (Q5075798) (← links)
• (Q5136269) (← links)
• A logarithmic approximation for unsplittable flow on line graphs (Q5501955) (← links)
• A knapsack intersection hierarchy (Q6161286) (← links)
• On improved interval cover mechanisms for crowdsourcing markets (Q6164503) (← links)
• Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem (Q6572832) (← links)
• Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings (Q6634523) (← links)