On Lagrangian Relaxation and Subset Selection Problems

DOI10.1007/978-3-540-93980-1_13zbMath1209.68647arXiv1512.06736OpenAlexW1531196853MaRDI QIDQ3602837

Ariel Kulik, Hadas Shachnai

Publication date: 12 February 2009

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.06736

Mathematics Subject Classification ID

Nonlinear programming (90C30) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

Network pollution games ⋮ On Lagrangian Relaxation and Subset Selection Problems

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient approximation for the generalized assignment problem
• Real-time scheduling with a budget
• Derandomized graph products
• Approximating the Throughput of Multiple Machines in Real-Time Scheduling
• A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
• Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Tight approximation algorithms for maximum general assignment problems
• On Lagrangian Relaxation and Subset Selection Problems
• Approximations of Weighted Independent Set and Hereditary Subset Problems
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• Resource Allocation in Bounded Degree Trees
• A Unified Approach to Approximating Partial Covering Problems
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• A unified approach to approximating resource allocation and scheduling

This page was built for publication: On Lagrangian Relaxation and Subset Selection Problems