Università di Pisa
Sistema bibliotecario di ateneo

Hardness of some optimal oblivious routing generalizations

Scutellà, Maria Grazia (2010) Hardness of some optimal oblivious routing generalizations. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] Other (GZip)
Available under License Creative Commons Attribution No Derivatives.

Download (167Kb)


    A generalization of the robust network design problem with oblivious routing is investigated in (Scutella', 2009), where the (uncertain) demands are served through two alternative routing templates. As indicated in that paper, it is an open issue as to whether the proposed problem, called (2-RND), is polynomially solvable or is NP-Hard. In this note we solve the issue by proving that (2-RND), as well as some generalizations, are NP-Hard. The hardness result holds true also when some routing templates are given as input data. This strengthens the results in (Scutella', 2009), where special (2-RND) cases are devised which are tractable from a computational perspective.

    Item Type: Book
    Uncontrolled Keywords: robust optimization, oblivious routing, mathematical models, NP-Hardness.
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 04 Dec 2014 14:34
    Last Modified: 04 Dec 2014 14:34
    URI: http://eprints.adm.unipi.it/id/eprint/2249

    Repository staff only actions

    View Item