IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v27y2014i2d10.1007_s10878-012-9526-3.html
   My bibliography  Save this article

Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems

Author

Listed:
  • Zi Xu

    (Shanghai University)

  • Donglei Du

    (University of New Brunswick)

  • Dachuan Xu

    (Beijing University of Technology)

Abstract

We consider the max-bisection problem and the disjoint 2-catalog segmentation problem, two well-known NP-hard combinatorial optimization problems. For the first problem, we apply the semidefinite programming (SDP) relaxation and the RPR2 technique of Feige and Langberg (J. Algorithms 60:1–23, 2006) to obtain a performance curve as a function of the ratio of the optimal SDP value over the total weight through finer analysis under the assumption of convexity of the RPR2 function. This ratio is shown to be in the range of [0.5,1]. The performance curve implies better approximation performance when this ratio is away from 0.92, corresponding to the lowest point on this curve with the currently best approximation ratio of 0.7031 due to Feige and Langberg (J. Algorithms 60:1–23, 2006). For the second problem, similar technique results in an approximation ratio of 0.7469, improving the previously best known result 0.7317 due to Wu et al. (J. Ind. Manag. Optim. 8:117–126, 2012).

Suggested Citation

  • Zi Xu & Donglei Du & Dachuan Xu, 2014. "Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems," Journal of Combinatorial Optimization, Springer, vol. 27(2), pages 315-327, February.
    • Handle: RePEc:spr:jcomop:v:27:y:2014:i:2:d:10.1007_s10878-012-9526-3
    DOI: 10.1007/s10878-012-9526-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-012-9526-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-012-9526-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:jcomop:v:27:y:2014:i:2:d:10.1007_s10878-012-9526-3. 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.