Improved Algorithm for Resource Allocation Problems

DOI10.1142/S0217595918500069zbMath1387.90093OpenAlexW2783815304MaRDI QIDQ4604919

Sakib A. Mondal

Publication date: 6 March 2018

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595918500069

zbMATH Keywords

schedulingapproximationprimal dualinteger linear programing

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

On improved interval cover mechanisms for crowdsourcing markets

Uses Software

• SCIP

Cites Work

• Unnamed Item
• Unnamed Item
• A quasi-PTAS for unsplittable flow on line graphs
• Resource Allocation for Covering Time Varying Demands
• Primal-Dual Schema for Capacitated Covering Problems
• On Column-Restricted and Priority Covering Integer Programs
• Multicommodity demand flow in a tree and packing integer programs
• Fast Approximation Algorithms for Knapsack Problems
• A Greedy Heuristic for the Set-Covering Problem
• A linear-time approximation algorithm for the weighted vertex cover problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Reducibility among Combinatorial Problems
• A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem
• New Approximation Schemes for Unsplittable Flow on a Path
• A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
• A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths

This page was built for publication: Improved Algorithm for Resource Allocation Problems