IDEAS home Printed from https://ideas.repec.org/b/spr/spopap/978-1-4614-1701-9.html
   My bibliography  Save this book

Design and Analysis of Approximation Algorithms

Author

Listed:
  • Ding-Zhu Du

    (University of Texa, Dallas)

  • Ker-I Ko

    (Stony Brook University)

  • Xiaodong Hu

Abstract

No abstract is available for this item.

Individual chapters are listed in the "Chapters" tab

Suggested Citation

  • Ding-Zhu Du & Ker-I Ko & Xiaodong Hu, 2012. "Design and Analysis of Approximation Algorithms," Springer Optimization and Its Applications, Springer, number 978-1-4614-1701-9, September.
    • Handle: RePEc:spr:spopap:978-1-4614-1701-9
    DOI: 10.1007/978-1-4614-1701-9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Shi, Majun & Yang, Zishen & Wang, Wei, 2021. "Minimum non-submodular cover problem with applications," Applied Mathematics and Computation, Elsevier, vol. 410(C).
    2. Xiaozhi Wang & Xianyue Li & Bo Hou & Wen Liu & Lidong Wu & Suogang Gao, 2021. "A greedy algorithm for the fault-tolerant outer-connected dominating set problem," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 118-127, January.
    3. Hejiao Huang & Feng Shang & Jinling Liu & Hongwei Du, 2015. "Handling least privilege problem and role mining in RBAC," Journal of Combinatorial Optimization, Springer, vol. 30(1), pages 63-86, July.
    4. Zhao Zhang & Wen Xu & Weili Wu & Ding-Zhu Du, 2017. "A novel approach for detecting multiple rumor sources in networks with partial observations," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 132-146, January.
    5. Majun Shi & Zishen Yang & Wei Wang, 2023. "Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-16, January.
    6. Zishen Yang & Wei Wang & Majun Shi, 2021. "Algorithms and Complexity for a Class of Combinatorial Optimization Problems with Labelling," Journal of Optimization Theory and Applications, Springer, vol. 188(3), pages 673-695, March.
    7. Xiang Li & H. George Du & Panos M. Pardalos, 2020. "A variation of DS decomposition in set function optimization," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 36-44, July.
    8. Chuanwen Luo & Yongcai Wang & Yi Hong & Wenping Chen & Xingjian Ding & Yuqing Zhu & Deying Li, 2019. "Minimizing data collection latency with unmanned aerial vehicle in wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1019-1042, November.
    9. Xiang Li & H. George Du, 2020. "A short proof for stronger version of DS decomposition in set function optimization," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 901-906, November.
    10. Jiao Zhou & Zhao Zhang & Weili Wu & Kai Xing, 2014. "A greedy algorithm for the fault-tolerant connected dominating set in a general graph," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 310-319, July.
    11. Limin Wang & Wenxue Du & Zhao Zhang & Xiaoyan Zhang, 2017. "A PTAS for minimum weighted connected vertex cover $$P_3$$ P 3 problem in 3-dimensional wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 106-122, January.
    12. Kübra Tanınmış & Markus Sinnl, 2022. "A Branch-and-Cut Algorithm for Submodular Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2634-2657, September.
    13. Yichao He & Xinlu Zhang & Wenbin Li & Xiang Li & Weili Wu & Suogang Gao, 2016. "Algorithms for randomized time-varying knapsack problems," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 95-117, January.
    14. Zhao Zhang & Wei Liang & Hongmin W. Du & Siwen Liu, 2022. "Constant Approximation for the Lifetime Scheduling Problem of p -Percent Coverage," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2675-2685, September.

    Book Chapters

    The following chapters of this book are listed in IDEAS

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spopap:978-1-4614-1701-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.