The non-approximability of bicriteria network design problems

Author： Balint V.  

Publisher： Elsevier

ISSN： 1570-8667

Source： Journal of Discrete Algorithms, Vol.1, Iss.3, 2003-06, pp. : 339-355

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Bicriteria Network Design Problems

By Marathe M.V.   Ravi R.   Sundaram R.   Ravi S.S.   Rosenkrantz D.J.   Hunt H.B.  

Journal of Algorithms, Vol. 28, Iss. 1, 1998-07 ,pp. : 142-171

Academic Press

Access to resources Recommend Favorite

The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks

By Abbasi Sahar   Ebrahimnejad Sadoullah  

Optimization Methods and Software, Vol. 30, Iss. 3, 2015-05 ,pp. : 405-423

Taylor & Francis Ltd

Access to resources Recommend Favorite

Approximation Algorithms for Network Design Problems on Bounded Subsets

By Hochbaum D.S.   Naor J.S.  

Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. : 403-414

Academic Press

Access to resources Recommend Favorite

Chance‐constrained multi‐terminal network design problems

By  

Naval Research Logistics: An International Journal, Vol. 62, Iss. 4, 2015-06 ,pp. : 321-334

John Wiley & Sons Inc

Access to resources Recommend Favorite

Strong bounds on the approximability of two Pspace-hard problems in propositional planning

By Jonsson P.  

Annals of Mathematics and Artificial Intelligence, Vol. 26, Iss. 1-4, 1999-01 ,pp. : 133-147

Springer Publishing Company

Access to resources Recommend Favorite