On dependent randomized rounding algorithms

DOI10.1007/3-540-61310-2_25MaRDI QIDQ4645933zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

facility location problemfractional solutionlotsizing problempositive edgesatisfiability problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10)

Cites work

• .878-approximation algorithms for MAX CUT and MAX 2SAT
• A Greedy Heuristic for the Set-Covering Problem
• Almost optimal set covers in finite VC-dimension
• An approximation algorithm for the generalized assignment problem
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Bin packing can be solved within 1+epsilon in linear time
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• scientific article; zbMATH DE number 47262 (Why is no real title available?)
• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1263202 (Why is no real title available?)
• scientific article; zbMATH DE number 1263278 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 863497 (Why is no real title available?)
• Minimal cut cover of a graph with an application to the testing of electronic boards
• Nonlinear formulations and improved randomized approximation algorithms for multicut problems
• On the notion of balance of a signed graph
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Shortest paths, single origin‐destination network design, and associated polyhedra
• Source sink flows with capacity installation in batches
• The Minimum Satisfiability Problem
• Unimodular functions

Cited in

(2)

• Differential approximation of MIN SAT, MAX SAT and related problems
• Approximate clustering of incomplete fingerprints

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)