On dependent randomized rounding algorithms
From MaRDI portal
Publication:4645933
DOI10.1007/3-540-61310-2_25zbMATH Open1414.90191OpenAlexW1941111399MaRDI QIDQ4645933FDOQ4645933
Authors: Chung-Piaw Teo, Dimitris Bertsimas, Rakesh V. Vohra 
Publication date: 11 January 2019
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61310-2_25
Cites Work
- A Greedy Heuristic for the Set-Covering Problem
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- An approximation algorithm for the generalized assignment problem
- On the notion of balance of a signed graph
- Title not available (Why is that?)
- Bin packing can be solved within 1+epsilon in linear time
- Almost optimal set covers in finite VC-dimension
- Title not available (Why is that?)
- The Minimum Satisfiability Problem
- Title not available (Why is that?)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Title not available (Why is that?)
- .878-approximation algorithms for MAX CUT and MAX 2SAT
- Nonlinear formulations and improved randomized approximation algorithms for multicut problems
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Title not available (Why is that?)
- Unimodular functions
- Title not available (Why is that?)
- Minimal cut cover of a graph with an application to the testing of electronic boards
- Source sink flows with capacity installation in batches
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: On dependent randomized rounding algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645933)
