Fast Approximation Algorithms for Fractional Packing and Covering Problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1839427
- Faster approximation schemes for fractional multicommodity flow problems
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- Fast approximation algorithms for multicommodity flow problems
- Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations
Cited in
(89)- Packing trees in communication networks
- Flows with unit path capacities and related packing and covering problems
- Hitting sets when the VC-dimension is small
- Approximability of flow shop scheduling
- A technique for speeding up the solution of the Lagrangean dual
- An approximation algorithm for the generalized assignment problem
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
- Scheduling multicasts on unit-capacity trees and meshes.
- Approximating covering integer programs with multiplicity constraints
- Solving MIPs via scaling-based augmentation
- iGreen: green scheduling for peak demand minimization
- Fast approximation of matroid packing and covering
- Adaptive game playing using multiplicative weights
- A sublinear-time randomized approximation algorithm for matrix games
- On the approximability of robust network design
- A simple method for convex optimization in the oracle model
- On integer balancing of directed graphs
- Mobile facility location: combinatorial filtering via weighted occupancy
- Near-linear algorithms for geometric hitting sets and set covers
- I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
- Exponential weight approachability, applications to calibration and regret minimization
- Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- Greedy distributed optimization of multi-commodity flows
- A multiplicative weights update algorithm for MINLP
- Approximation and online algorithms for multidimensional bin packing: a survey
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and =(1/)-convergence
- An approximation algorithm for the general max-min resource sharing problem
- Approximation algorithms for covering/packing integer programs
- A note on a variant of the online open end bin packing problem
- The Lagrangian search method
- Better bin packing approximations via discrepancy theory
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms
- Distributed Broadcast Revisited: Towards Universal Optimality
- Oracle-based robust optimization via online learning
- Fast First-Order Algorithms for Packing–Covering Semidefinite Programs
- Vector bin packing with multiple-choice
- Near-optimal distributed maximum flow
- Near-linear time approximation schemes for some implicit fractional packing problems
- Linear coupling: an ultimate unification of gradient and mirror descent
- A new approach to computing optimal schedules for the job-shop scheduling problem
- scientific article; zbMATH DE number 2163022 (Why is no real title available?)
- scientific article; zbMATH DE number 1839427 (Why is no real title available?)
- Approximation Schemes for Covering and Packing
- Register loading via linear programming
- Fractional set cover in the streaming model
- Multicommodity network flows: A survey. II: Solution methods
- An improved approximation scheme for variable-sized bin packing
- Task scheduling in networks
- Distributed approximate maximum matching in the CONGEST model
- Dynamic resource allocation in the cloud with near-optimal efficiency
- Inferring Sparse Preference Lists from Partial Information
- Interior-point-based online stochastic bin packing
- New error measures and methods for realizing protein graphs from distance data
- Active learning for cost-sensitive classification
- Faster min-max resource sharing in theory and practice
- Rounding of convex sets and efficient gradient methods for linear programming problems
- Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations
- A fast approximation scheme for fractional covering problems with variable upper bounds
- Price-based protocols for fair resource allocation, convergence time analysis and extension to Leontief utilities
- Flows with Unit Path Capacities and Related Packing and Covering Problems
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
- The entropy rounding method in approximation algorithms
- Computational Science and Its Applications – ICCSA 2004
- Faster shortest-path algorithms for planar graphs
- Barrier subgradient method
- A simple method for convex optimization in the oracle model
- Minimum cut in \(O(m \log^2 n)\) time
- Improved parallel approximation of a class of integer programming problems
- A generalized approximation framework for fractional network flow and packing problems
- Minimum cut in O(m^2 n time
- Finding the maximum subgraph of prescribed strength
- High-accuracy multicommodity flows via iterative refinement
- Computing data distribution from query selectivities
- A simple (1-)-approximation semi-streaming algorithm for maximum (weighted) matching
- Bounding the price-of-fair-sharing using knapsack-cover constraints to guide near-optimal cost-recovery algorithms
- An improved approximation algorithm for the partial Latin square extension problem.
- Self-concordant barriers for convex approximations of structured convex sets
- Tree-packing revisited: faster fully dynamic min-cut and arboricity
- Decremental (1+)-approximate maximum eigenvector: dynamic power method
- An efficient algorithm for minimizing ordered norms in fractional load balancing
- A scalable learning approach for efficient computation of independent set and cover variants
- Faster and simpler approximation algorithms for mixed packing and covering problems
- A quantization framework for smoothed analysis of Euclidean optimization problems
- Approximation algorithms for general packing problems and their application to the multicast congestion problem
- On routing in VLSI design and communication networks
- Pricing for fairness: distributed resource allocation for multiple objectives
- Dynamic programming based algorithms for set multicover and multiset multicover problems
This page was built for publication: Fast Approximation Algorithms for Fractional Packing and Covering Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4848416)
