{ "labelLang" : "hun", "responseDate" : "2024-03-29 00:10", "content" : { "otype" : "BookChapter", "mtid" : 22571047, "status" : "APPROVED", "published" : true, "comment" : "Dept. of CIS, University of Pennsylvania, Philadelphia, PA, United States \n Toyota Technological Institute, Chicago, IL 60637, Japan \n Cited By :42 \n Export Date: 26 August 2022 \n Correspondence Address: Chakraborty, T.; Dept. of CIS, , Philadelphia, PA, United States; email: tanmoy@seas.upenn.edu", "unhandledTickets" : 0, "oldTimestamp" : "2018-09-14T08:34:12.000+0000", "deleted" : false, "oldId" : 12571047, "lastRefresh" : "2023-12-12T12:50:57.038+0000", "lastModified" : "2019-07-04T11:48:08.191+0000", "created" : "2012-09-25T15:54:55.000+0000", "creator" : { "otype" : "Author", "mtid" : 10031865, "link" : "/api/author/10031865", "label" : "Tardos Éva (Matematika)", "familyName" : "Tardos", "givenName" : "Éva", "published" : true, "oldId" : 10031865, "snippet" : true }, "lastDuplumSearch" : "2023-12-12T12:49:21.994+0000", "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 25, "link" : "/api/publicationtype/25", "label" : "Könyvrészlet", "code" : 25, "otypeName" : "BookChapter", "listPosition" : 2, "published" : true, "oldId" : 25, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000312, "link" : "/api/subtype/10000312", "label" : "Konferenciaközlemény (Könyvrészlet)", "name" : "Konferenciaközlemény", "nameEng" : "Conference paper", "docType" : { "otype" : "PublicationType", "mtid" : 25, "link" : "/api/publicationtype/25", "label" : "Könyvrészlet", "code" : 25, "otypeName" : "BookChapter", "listPosition" : 2, "published" : true, "oldId" : 25, "snippet" : true }, "listPosition" : 228, "published" : true, "oldId" : 10000312, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "firstAuthor" : "Chakraborty, T", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 20289980, "link" : "/api/authorship/20289980", "label" : "Chakraborty, T", "listPosition" : 1, "share" : 0.0, "first" : true, "last" : false, "familyName" : "Chakraborty", "givenName" : "T", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 28617398, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 20289981, "link" : "/api/authorship/20289981", "label" : "Chuzhoy, J", "listPosition" : 2, "share" : 0.0, "first" : false, "last" : false, "familyName" : "Chuzhoy", "givenName" : "J", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 28617397, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 20289982, "link" : "/api/authorship/20289982", "label" : "Khanna, S", "listPosition" : 3, "share" : 0.0, "first" : false, "last" : true, "familyName" : "Khanna", "givenName" : "S", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 28617396, "snippet" : true } ], "title" : "Network design for vertex connectivity", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 21619906, "link" : "/api/publicationidentifier/21619906", "label" : "DOI: 10.1145/1374376.1374403", "source" : { "otype" : "PlainSource", "mtid" : 6, "link" : "/api/publicationsource/6", "label" : "DOI", "type" : { "otype" : "PublicationSourceType", "mtid" : 10001, "link" : "/api/publicationsourcetype/10001", "label" : "DOI", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "DOI", "nameEng" : "DOI", "linkPattern" : "https://doi.org/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 6, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "10.1145/1374376.1374403", "realUrl" : "https://doi.org/10.1145/1374376.1374403", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 5258033, "link" : "/api/publicationidentifier/5258033", "label" : "WoS: 000266622800020", "source" : { "otype" : "PlainSource", "mtid" : 1, "link" : "/api/publicationsource/1", "label" : "WoS", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "WoS", "nameEng" : "WoS", "linkPattern" : "https://www.webofscience.com/wos/woscc/full-record/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 1, "snippet" : true }, "validState" : "NO", "idValue" : "000266622800020", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000266622800020", "published" : false, "oldId" : 2484606, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 5258034, "link" : "/api/publicationidentifier/5258034", "label" : "Scopus: 57049136166", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "57049136166", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-57049136166", "published" : false, "oldId" : 2484607, "snippet" : true } ], "firstPage" : "167", "lastPage" : "176", "firstPageOrInternalIdForSort" : "167", "pageLength" : 10, "publishedYear" : 2008, "digital" : null, "printed" : null, "sourceYear" : 2012, "packet" : "618929", "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "nationalOrigin" : null, "missingAuthor" : false, "oaType" : "NONE", "oaCheckDate" : "2023-12-12", "oaFree" : false, "citationCount" : 0, "citationCountUnpublished" : 0, "citationCountWoOther" : 0, "independentCitCountWoOther" : 0, "doiCitationCount" : 0, "wosCitationCount" : 0, "scopusCitationCount" : 0, "independentCitationCount" : 0, "unhandledCitationCount" : 0, "citingPubCount" : 0, "independentCitingPubCount" : 0, "unhandledCitingPubCount" : 0, "citedPubCount" : 5, "citedCount" : 5, "references" : [ { "otype" : "Reference", "mtid" : 13903675, "link" : "/api/reference/13903675", "label" : "1. Agrawal, A., Klein, P.N., Ravi, R., When trees collide: An approximation algorithm for the generalized steiner problem on networks (1995) SIAM Journal of Computing, 24 (3), pp. 440-456", "listPosition" : 1, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903676, "link" : "/api/reference/13903676", "label" : "2. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M., Proof verification and the hardness of approximation problems (1998) Journal of the ACM, 45 (3), pp. 501-555", "listPosition" : 2, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903677, "link" : "/api/reference/13903677", "label" : "3. Arora, S., Safra, S., Probabilistic checking of proofs: A new characterization of NP (1998) Journal of the ACM, 45 (1), pp. 70-122", "listPosition" : 3, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903678, "link" : "/api/reference/13903678", "label" : "4. Auletta, V., Dinitz, Y., Nutov, Z., Parente, D., A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph (1999) Journal of Algorithms, 32 (L), pp. 21-30", "listPosition" : 4, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903679, "link" : "/api/reference/13903679", "label" : "5. Bern, M., Plassmann, P., The steiner problem with edge lengths 1 and 2 (1989) Information Processing Letters, 32, pp. 171-176", "listPosition" : 5, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903680, "link" : "/api/reference/13903680", "label" : "6. Cheriyan, J., Jordan, T., Nutov, Z., On rooted node-connectivity problems (2001) Algorithmica, 30 (3), pp. 353-375", "listPosition" : 6, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903681, "link" : "/api/reference/13903681", "label" : "7. Cheriyan, J., Vempala, S., Vetta, A., An approximation algorithm for the minimum-cost k-vertex connected subgraph (2003) SIAM Journal of Computing, 32 (4), pp. 1050-1055", "listPosition" : 7, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903682, "link" : "/api/reference/13903682", "label" : "8. Cheriyan, J., Vempala, S., Vetta, A., Network design via iterative rounding of setpair relaxations (2006) Combinatorial, 26 (3), pp. 255-275", "listPosition" : 8, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903683, "link" : "/api/reference/13903683", "label" : "9. Dinitz, Y., Nutov, Z., A 3-approximation algorithm for finding optimum 4, 5-vertex-connected spanning subgraphs (1999) Journal of Algorithms, 32 (L), pp. 31-40", "listPosition" : 9, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903684, "link" : "/api/reference/13903684", "label" : "10. Fakcharoenphol, J., Laekhanukit, B., An O(log2 k)-approximation algorithm for the k-vertex connected subgraph problem STOC 2008, , to appear", "listPosition" : 10, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903685, "link" : "/api/reference/13903685", "label" : "11. Fleischer, L., Jain, K., Williamson, D.P., Iterative rounding 2-approximation algorithms for minimum cost vertex connectivity problems (2006) Journal of Computer and System Sciences, 72 (5), pp. 838-867", "listPosition" : 11, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903686, "link" : "/api/reference/13903686", "label" : "12. Frank, A., Jordan, T., Minimal edge-coverings of pairs of sets (1995) Journal of Combinatorial Theory, Series B, 65 (1), pp. 73-110", "listPosition" : 12, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903687, "link" : "/api/reference/13903687", "label" : "13. Frank, A., Tardos, E., An application of submodular flows (1989) Linear Algebra and its Applications, 114-115, pp. 329-348", "listPosition" : 13, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903688, "link" : "/api/reference/13903688", "label" : "14. Goemans, M., Williamson, D., The primal-dual method for approximation algorithms and its application to network design problems (1997) Approximation Algorithms, D. Hochbaum, Ed., PWS", "listPosition" : 14, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903689, "link" : "/api/reference/13903689", "label" : "15. Goemans, M.X., Goldberg, A.V., Plotkin, E.T.S.A., Shmoys, D.B., Williamson, D.P., Improved approximation algorithms for network design problems (1994) Proceedings of the fifth annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 223-232", "listPosition" : 15, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903690, "link" : "/api/reference/13903690", "label" : "16. Goemans, M.X., Mihail, M., Vazirani, V., Williamson, D.P., A primal-dual approximation algorithm for generalized steiner network problems (1995) Combinatorica, 15 (3), pp. 435-454", "listPosition" : 16, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903691, "link" : "/api/reference/13903691", "label" : "17. Jain, K., Factor 2 approximation algorithm for the generalized steiner network problem (1998) Proceedings of the thirty-ninth annual IEEE Foundations of Computer Science (FOCS), pp. 448-457", "listPosition" : 17, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903692, "link" : "/api/reference/13903692", "label" : "18. Khuller, S., Raghavachari, B., Improved approximation algorithms for uniform connectivity problems (1996) Journal of Algorithms, 21 (2), pp. 434-450", "listPosition" : 18, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903693, "link" : "/api/reference/13903693", "label" : "19. Kortsarz, G., Krauthgamer, R., Lee, J.R., Hardness of approximation for vertex-connectivity network design problems (2004) SIAM Journal of Computing, 33 (3), pp. 704-720", "listPosition" : 19, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903694, "link" : "/api/reference/13903694", "label" : "20. Kortsarz, G., Nutov, Z., Approximating node connectivity problems via set covers (2003) Algorithmica, 37 (2), pp. 75-92", "listPosition" : 20, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903695, "link" : "/api/reference/13903695", "label" : "21. Kortsarz, G., Nutov, Z., Approximating k-node connected subgraphs via critical graphs (2005) SIAM Journal of Computing, 35 (1), pp. 247-257", "listPosition" : 21, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903696, "link" : "/api/reference/13903696", "label" : "22. Mader, W., Endlichkeitsätze für k-kritische graphen (german). (1977) Mathematische Annalen, 229, pp. 143-153", "listPosition" : 22, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903697, "link" : "/api/reference/13903697", "label" : "23. Ravi, R., Williamson, D.P., An approximation algorithm for minimum-cost vertex-connectivity problems (1997) Algorithmica, 18 (1), pp. 21-43", "listPosition" : 23, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 13903698, "link" : "/api/reference/13903698", "label" : "24. Raz, R., A parallel repetition theorem (1998) SIAM Journal of Computing, 27 (3), pp. 763-803", "listPosition" : 24, "published" : false, "snippet" : true } ], "hasCitationDuplums" : false, "userChangeableUntil" : "2017-12-31T23:00:00.000+0000", "publishDate" : "2012-09-25T16:13:46.000+0000", "directInstitutesForSort" : "", "ownerAuthorCount" : 4, "ownerInstituteCount" : 13, "directInstituteCount" : 0, "authorCount" : 3, "contributorCount" : 0, "book" : { "otype" : "Book", "mtid" : 2074190, "link" : "/api/publication/2074190", "label" : "Dwork Cynthia. 40th Annual ACM Symposium on Theory of Computing, STOC 2008. (2008) ISBN:9781605580470; 1605580473", "core" : true, "citation" : false, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 23, "link" : "/api/publicationtype/23", "label" : "Könyv", "code" : 23, "otypeName" : "Book", "listPosition" : 3, "published" : true, "oldId" : 23, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000144, "link" : "/api/subtype/10000144", "label" : "Konferenciakötet (Könyv)", "name" : "Konferenciakötet", "nameEng" : "Conference proceedings", "docType" : { "otype" : "PublicationType", "mtid" : 23, "link" : "/api/publicationtype/23", "label" : "Könyv", "code" : 23, "otypeName" : "Book", "listPosition" : 3, "published" : true, "oldId" : 23, "snippet" : true }, "listPosition" : 345, "published" : true, "oldId" : 10000144, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "title" : "40th Annual ACM Symposium on Theory of Computing, STOC 2008", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 572544, "link" : "/api/publicationidentifier/572544", "label" : "ISBN: 9781605580470", "source" : { "otype" : "PlainSource", "mtid" : 122, "link" : "/api/publicationsource/122", "label" : "ISBN", "type" : { "otype" : "PublicationSourceType", "mtid" : 10002, "link" : "/api/publicationsourcetype/10002", "label" : "Egyéb", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "ISBN", "nameEng" : "ISBN", "linkPattern" : "https://www.worldcat.org/search?q=isbn%3A@@@", "publiclyVisible" : true, "published" : true, "oldId" : 122, "snippet" : true }, "idValue" : "9781605580470", "realUrl" : "https://www.worldcat.org/search?q=isbn%3A9781605580470", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15709146, "link" : "/api/publicationidentifier/15709146", "label" : "ISBN: 1605580473", "source" : { "otype" : "PlainSource", "mtid" : 122, "link" : "/api/publicationsource/122", "label" : "ISBN", "type" : { "otype" : "PublicationSourceType", "mtid" : 10002, "link" : "/api/publicationsourcetype/10002", "label" : "Egyéb", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "ISBN", "nameEng" : "ISBN", "linkPattern" : "https://www.worldcat.org/search?q=isbn%3A@@@", "publiclyVisible" : true, "published" : true, "oldId" : 122, "snippet" : true }, "idValue" : "1605580473", "realUrl" : "https://www.worldcat.org/search?q=isbn%3A1605580473", "published" : true, "snippet" : true } ], "publishedAt" : [ { "otype" : "City", "mtid" : 10367, "link" : "/api/city/10367", "label" : "New York, Amerikai Egyesült Államok", "partOf" : { "otype" : "Country", "mtid" : 10017, "link" : "/api/country/10017", "label" : "Amerikai Egyesült Államok", "published" : true, "oldId" : 13, "snippet" : true }, "published" : true, "oldId" : 870, "snippet" : true } ], "publishedYear" : 2008, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : false, "conferencePublication" : true, "published" : true, "oldId" : 2074190, "snippet" : true }, "hasQualityFactor" : false, "link" : "/api/publication/22571047", "label" : "Chakraborty T et al. Network design for vertex connectivity. (2008) Megjelent: 40th Annual ACM Symposium on Theory of Computing, STOC 2008 pp. 167-176", "template" : "