Pages that link to "Item:Q4848416"
From MaRDI portal
The following pages link to Fast Approximation Algorithms for Fractional Packing and Covering Problems (Q4848416):
Displaying 50 items.
- Vector bin packing with multiple-choice (Q427903) (← links)
- Register loading via linear programming (Q494793) (← links)
- An improved approximation scheme for variable-sized bin packing (Q504994) (← links)
- New error measures and methods for realizing protein graphs from distance data (Q517453) (← links)
- Faster min-max resource sharing in theory and practice (Q542051) (← links)
- Barrier subgradient method (Q633113) (← links)
- Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- An improved approximation algorithm for the partial Latin square extension problem. (Q703265) (← links)
- Self-concordant barriers for convex approximations of structured convex sets (Q707744) (← links)
- Faster and simpler approximation algorithms for mixed packing and covering problems (Q884474) (← links)
- A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
- Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
- On routing in VLSI design and communication networks (Q944702) (← links)
- Pricing for fairness: distributed resource allocation for multiple objectives (Q973022) (← links)
- Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- Flows with unit path capacities and related packing and covering problems (Q1041430) (← links)
- Hitting sets when the VC-dimension is small (Q1041786) (← links)
- Approximability of flow shop scheduling (Q1290640) (← links)
- A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
- An approximation algorithm for the generalized assignment problem (Q1319018) (← links)
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (Q1363422) (← links)
- Scheduling multicasts on unit-capacity trees and meshes. (Q1401961) (← links)
- Approximating covering integer programs with multiplicity constraints (Q1406040) (← links)
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- iGreen: green scheduling for peak demand minimization (Q1675631) (← links)
- A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
- Fast approximation of matroid packing and covering (Q1730564) (← links)
- Adaptive game playing using multiplicative weights (Q1818286) (← links)
- A sublinear-time randomized approximation algorithm for matrix games (Q1919166) (← links)
- On the approximability of robust network design (Q1998836) (← links)
- A simple method for convex optimization in the oracle model (Q2164690) (← links)
- On integer balancing of directed graphs (Q2242913) (← links)
- Mobile facility location: combinatorial filtering via weighted occupancy (Q2251136) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs (Q2339449) (← links)
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409) (← links)
- Exponential weight approachability, applications to calibration and regret minimization (Q2342741) (← links)
- Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis (Q2362358) (← links)
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
- Greedy distributed optimization of multi-commodity flows (Q2377262) (← links)
- A multiplicative weights update algorithm for MINLP (Q2397756) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908) (← links)
- An approximation algorithm for the general max-min resource sharing problem (Q2492678) (← links)
- Approximation algorithms for covering/packing integer programs (Q2575835) (← links)
- A note on a variant of the online open end bin packing problem (Q2661578) (← links)
- The Lagrangian search method (Q2768049) (← links)
- Better bin packing approximations via discrepancy theory (Q2816297) (← links)
