Corpus ID: 17380289

Randomized Pipage Rounding for Matroid Polytopes and Applications

@article{Chekuri2009RandomizedPR,
  title={Randomized Pipage Rounding for Matroid Polytopes and Applications},
  author={C. Chekuri and J. Vondr{\'a}k},
  journal={ArXiv},
  year={2009},
  volume={abs/0909.4348}
}
  • C. Chekuri, J. Vondrák
  • Published 2009
  • Computer Science, Mathematics
  • ArXiv
  • We present concentration bounds for linear functions of random variables arising from the pipage rounding procedure on matroid polytopes. As an application, we give a (1 − 1/e − ǫ)-approximation algorithm for the problem of maximizing a monotone submodular function subject to 1 matroid and k linear constraints, for any constant k ≥ 1 and ǫ > 0. This generalizes the result for k linear constraints by Kulik et al. [11]. We also give the same result for a super-constant number k of ”loose” linear… CONTINUE READING
    Learning submodular functions
    • 104
    • Open Access
    An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
    • 116
    • Open Access
    Secretary problems: laminar matroid and interval scheduling
    • 47
    • Open Access
    Approximation Algorithms for Maximin Fair Division
    • 59
    • Open Access
    A note on concentration of submodular functions
    • 34
    • Open Access
    Unified Algorithms for Online Learning and Competitive Analysis
    • 37
    • Open Access
    One step at a time: Optimizing SDN upgrades in ISP networks
    • 44
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 25 REFERENCES
    An analysis of approximations for maximizing submodular set functions—I
    • 3,418
    • Open Access
    An analysis of approximations for maximizing submodular set functions—I
    • 3,418
    • Open Access
    Combinatorial optimization. Polyhedra and efficiency.
    • 3,223
    • Open Access
    Randomized rounding: A technique for provably good algorithms and algorithmic proofs
    • 925
    Optimal approximation for the submodular welfare problem in the value oracle model
    • 446
    • Open Access
    Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
    • 359
    • Open Access
    Best Algorithms for Approximating the Maximum of a Submodular Set Function
    • 409
    Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds
    • 267
    • Highly Influential
    • Open Access
    Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee
    • 301
    • Open Access
    Maximizing submodular set functions subject to multiple linear constraints
    • 160
    • Highly Influential
    • Open Access