{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T19:33:40Z","timestamp":1770060820843,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642114397","type":"print"},{"value":"9783642114403","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_21","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T11:03:36Z","timestamp":1265108616000},"page":"228-239","source":"Crossref","is-referenced-by-count":5,"title":["The Covert Set-Cover Problem with Application to Network Discovery"],"prefix":"10.1007","author":[{"given":"Sandeep","family":"Sen","sequence":"first","affiliation":[]},{"given":"V. N.","family":"Muralidhara","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem, pp. 100\u2013105 (2003)","DOI":"10.1145\/780555.780558"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Fiat, A., Leighton, F.T.: Making commitments in the face of uncertainty: How to pick a winner almost every time (extended abstract), pp. 519\u2013530 (1996)","DOI":"10.1145\/237814.238000"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/11604686_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"Z. Beerliova","year":"2005","unstructured":"Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Miha\u013e\u00e1k, M., Shankar Ram, L.: Network discovery and verification. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 127\u2013138. Springer, Heidelberg (2005)"},{"issue":"12","key":"21_CR4","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","volume":"24","author":"Z. Beerliova","year":"2006","unstructured":"Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Mihal\u00e1k, M., Shankar Ram, L.: Network discovery and verification. IEEE Journal on Selected Areas in Communications\u00a024(12), 2168\u20132181 (2006)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Bejerano, Y., Rastogi, R.: Robust monitoring of link delays and faults in ip networks. In: INFOCOM (2003)","DOI":"10.1109\/INFCOM.2003.1208666"},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Jonson","year":"1974","unstructured":"Jonson, D.S.: Approximation algorithms for combinatorial problem. Journal of Computer and System Sciences\u00a0(9), 256\u2013278 (1974)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln for approximating set cover. J. ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"S. Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Discrete Applied Mathematics\u00a070(3), 217\u2013229 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR9","volume-title":"Computers and intractability","author":"M.R. Grey","year":"1979","unstructured":"Grey, M.R., Jonson, D.S.: Computers and intractability. Freeman, New York (1979)"},{"key":"21_CR10","volume-title":"Approximation algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation algorithms. Springer, New York (2001)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Chatal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research\u00a0(4), 233\u2013235 (1979)","DOI":"10.1287\/moor.4.3.233"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:40:34Z","timestamp":1606167634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}