Volume 25, Issue 2, February 2013

Special Issue: Combinatorial Optimization and Applications

ISSN: 1382-6905 (Print) 1573-2886 (Online)

In this issue (10 articles)

  1. No Access

    OriginalPaper

    Scheduling Packets with Values and Deadlines in Size-Bounded Buffers

    Fei Li Pages 165-175
    Look Inside Get Access

  2. No Access

    OriginalPaper

    Some variations on constrained minimum enclosing circle problem

    Arindam Karmakar, Sandip Das, Subhas C. Nandy… Pages 176-190
    Look Inside Get Access

  3. No Access

    OriginalPaper

    Complexity of determining the most vital elements for the p-median and p-center location problems

    Cristina Bazgan, Sonia Toubaline… Pages 191-207
    Look Inside Get Access

  4. No Access

    OriginalPaper

    Coverage with k-transmitters in the presence of obstacles

    Brad Ballinger, Nadia Benbernou, Prosenjit Bose… Pages 208-233
    Look Inside Get Access

  5. No Access

    OriginalPaper

    Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials

    Zhixiang Chen, Bin Fu Pages 234-254
    Look Inside Get Access

  6. No Access

    OriginalPaper

    Improved approximation for spanning star forest in dense graphs

    Jing He, Hongyu Liang Pages 255-264
    Look Inside Get Access

  7. No Access

    OriginalPaper

    A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP

    Viet Hung Nguyen Pages 265-278
    Look Inside Get Access

  8. No Access

    OriginalPaper

    Preemptive scheduling on two identical parallel machines with a single transporter

    Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich Pages 279-307
    Look Inside Get Access

  9. No Access

    OriginalPaper

    Discrete optimization with polynomially detectable boundaries and restricted level sets

    Yakov Zinder, Julia Memar, Gaurav Singh Pages 308-325
    Look Inside Get Access

  10. No Access

    OriginalPaper

    A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time

    Tadao Takaoka Pages 326-337
    Look Inside Get Access