Pages that link to "Item:Q1380937"
From MaRDI portal
The following pages link to Rounding algorithms for covering problems (Q1380937):
Displaying 22 items.
- Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
- Approximating integer programs with positive right-hand sides (Q656570) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- LP based heuristics for the multiple knapsack problem with assignment restrictions (Q863573) (← links)
- Rounding to an integral program (Q943791) (← links)
- The controlled rounding problem: Complexity and computational experience (Q1261381) (← links)
- On dependent randomized rounding algorithms (Q1306458) (← links)
- Approximating covering integer programs with multiplicity constraints (Q1406040) (← links)
- Minimizing average project team size given multi-skilled workers with heterogeneous skill levels (Q1651635) (← links)
- A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee (Q1888170) (← links)
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies (Q1923638) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- Approximability of open \(k\)-monopoly problems (Q2048211) (← links)
- Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set (Q2332657) (← links)
- The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
- New approaches to covering and packing problems (Q2768349) (← links)
- Approximation of optima of integer programs of the packing—covering type (Q4522859) (← links)
- Approximation algorithms for integer covering problems via greedy column generation (Q4846487) (← links)
- On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains (Q4973240) (← links)
- Experimental and Efficient Algorithms (Q5710071) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
