Expertini Research Research
  • Expertini Research profile
    • Computer Science PDF Available Non-peer-reviewed Preprint

    An Improved Approximation Algorithm for the Minimum $k$-Edge Connected Multi-Subgraph Problem

    📄 Download PDF 🔖 Bookmark Paper

    Abstract

    We give a randomized $1+\frac{5.06}{\sqrt{k}}$-approximation algorithm for the minimum $k$-edge connected spanning multi-subgraph problem, $k$-ECSM.
    📄 Full Paper Available as PDF
    This paper is available as a downloadable PDF.
    📄 Download PDF

    ✨ AI Plain-English Summary

    Get a plain-English summary of this paper generated by AI (5 free per day).

    Comments (0)

    No comments yet. Be the first to comment.

    Related Papers

    Computer Science PDF

    Core-Periphery Structure in Networks

    2012