Pages that link to "Item:Q2768349"
From MaRDI portal
The following pages link to New approaches to covering and packing problems (Q2768349):
Displaying 16 items.
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
- Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
- On approximating four covering and packing problems (Q1021577) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- Packing and covering with linear programming: a survey (Q2253646) (← links)
- Improved approximation algorithms for the spanning star forest problem (Q2392922) (← links)
- (Q2987386) (← links)
- (Q3316129) (← links)
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing (Q3586179) (← links)
- A Robust PTAS for Machine Covering and Packing (Q3586449) (← links)
- (Q4225302) (← links)
- Approximation algorithms for the covering Steiner problem (Q4537631) (← links)
- Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
- Approximating Sparse Covering Integer Programs Online (Q5247608) (← links)