Complexity and approximation of the connected set-cover problem
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- D. Huang & T. Allen & W. Notz & N. Zeng, 2006. "Global Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models," Journal of Global Optimization, Springer, vol. 34(3), pages 441-466, March.
- Stephen E. Chick & Noah Gans, 2009. "Economic Analysis of Simulation Selection Problems," Management Science, INFORMS, vol. 55(3), pages 421-437, March.
More about this item
KeywordsConnected set-cover; Computational complexity; Approximation algorithms;
StatisticsAccess and download statistics
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:jglopt:v:53:y:2012:i:3:p:563-572. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .
We have no references for this item. You can help adding them by using this form .