{ "labelLang" : "hun", "responseDate" : "2024-03-28 09:23", "content" : { "otype" : "BookChapter", "mtid" : 24739119, "status" : "APPROVED", "published" : true, "unhandledTickets" : 0, "oldTimestamp" : "2015-05-14T11:07:12.000+0000", "deleted" : false, "oldId" : 14739119, "lastRefresh" : "2022-06-10T11:51:55.560+0000", "lastModified" : "2021-10-29T18:21:32.802+0000", "created" : "2015-05-14T10:46:03.000+0000", "creator" : { "otype" : "Admin", "mtid" : 10025514, "link" : "/api/admin/10025514", "label" : "xÓváriné Koczka Ildikó (ELTE TTK MAT Adm, admin)", "familyName" : "xÓváriné Koczka", "givenName" : "Ildikó", "published" : true, "oldId" : 10025514, "snippet" : true }, "duplumSearchResult" : { "id" : 4708724, "creationDate" : "2023-12-12T12:50:04.228+0000", "startDate" : "2023-12-12T12:50:04.443+0000", "creator" : { "otype" : "Admin", "mtid" : 10071503, "link" : "/api/admin/10071503", "label" : "Szabó Regina (ELTE TTK admin 5)", "familyName" : "Szabó", "givenName" : "Regina", "published" : true, "snippet" : true } }, "duplumRole" : "SUSPECT", "lastDuplumOK" : "2021-11-08T16:33:06.918+0000", "lastDuplumSearch" : "2023-12-12T12:50:04.443+0000", "adminApproved" : "2015-05-14T11:07:12.000+0000", "adminApprover" : { "otype" : "Admin", "mtid" : 10025514, "link" : "/api/admin/10025514", "label" : "xÓváriné Koczka Ildikó (ELTE TTK MAT Adm, admin)", "familyName" : "xÓváriné Koczka", "givenName" : "Ildikó", "published" : true, "oldId" : 10025514, "snippet" : true }, "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 31, "link" : "/api/publicationtype/31", "label" : "Egyéb konferenciaközlemény", "code" : 31, "otypeName" : "BookChapter", "listPosition" : 4, "published" : true, "oldId" : 31, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000197, "link" : "/api/subtype/10000197", "label" : "Konferenciaközlemény (Egyéb konferenciaközlemény)", "name" : "Konferenciaközlemény", "nameEng" : "Conference paper", "docType" : { "otype" : "PublicationType", "mtid" : 31, "link" : "/api/publicationtype/31", "label" : "Egyéb konferenciaközlemény", "code" : 31, "otypeName" : "BookChapter", "listPosition" : 4, "published" : true, "oldId" : 31, "snippet" : true }, "listPosition" : 452, "published" : true, "oldId" : 10000197, "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" : "Cheriyan, J", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 40047533, "link" : "/api/authorship/40047533", "label" : "Cheriyan, J", "listPosition" : 1, "share" : 0.0, "first" : true, "last" : false, "familyName" : "Cheriyan", "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" : 68971948, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 40047534, "link" : "/api/authorship/40047534", "label" : "Vempala, S", "listPosition" : 2, "share" : 0.0, "first" : false, "last" : false, "familyName" : "Vempala", "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" : 68971947, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 40047535, "link" : "/api/authorship/40047535", "label" : "Vetta, A", "listPosition" : 3, "share" : 0.0, "first" : false, "last" : true, "familyName" : "Vetta", "givenName" : "A", "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" : 68971946, "snippet" : true } ], "title" : "Approximation algorithms for minimum-cost k-vertex connected subgraphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 9134187, "link" : "/api/publicationidentifier/9134187", "label" : "Scopus: 0036038426", "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" : "0036038426", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-0036038426", "published" : false, "oldId" : 9125793, "snippet" : true } ], "firstPage" : "306", "lastPage" : "312", "firstPageOrInternalIdForSort" : "306", "pageLength" : 7, "publishedYear" : 2002, "digital" : null, "printed" : null, "sourceYear" : 2015, "packet" : "31209", "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "nationalOrigin" : null, "missingAuthor" : false, "oaType" : "NONE", "oaCheckDate" : "2022-06-10", "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" : 6, "citedCount" : 6, "referenceList" : "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, pp. 21-30; \n\nCheriyan, J., Jordan, T., Nutov, Z., On rooted node-connectivity problems (2001) Algorithmica, 30, pp. 353-375; \n\nCheriyan, J., Vempala, S., Edge coverings of setpairs and the iterative rounding method, submitted for journal publication, September 2001 (2001) Preliminary Version in the Proceedings of the 8th International Integer Programming and Combinatorial Optimization Conference, Utrecht, The Netherlands, pp. 30-44; \n\nFrank, A., Connectivity augmentation problems in network design (1994) Mathematical Programming: State of the Art 1994, pp. 34-63. , (Eds. J. R. Birge and K. G. Murty); The University of Michigan, Ann Arbor, MI; \n\nFrank, A., Jordan, T., Minimal edge-coverings of pairs of sets (1995) Journal of Combinatorial Theory, Series B, 65, pp. 73-110; \n\nFrank, A., Tardos, E., An application of submodular flows (1989) Linear Algebra and Its Applications, 114-115, pp. 329-348; \n\nFleischer, L., Jain, K., Williamson, D.P., An iterative rounding 2-approximation algorithm for the element connectivity problem Proc. 42nd IEEE FOCS, October 2001; \n\nGabow, H.N., A representation for crossing set families with applications to submodular flow problems Proc. 4th Ann. ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 202-211; \n\nGabow, H.N., Using expander graphs to find vertex connectivity Proc. 41st IEEE FOCS, Nov. 2000; \n\nGoemans, M., Goldberg, A., Plotkin, S., Shmoys, D., Tardos, E., Williamson, D., Improved approximation algorithms for network design problems Proc. 5th Ann. ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 223-232; \n\nGoemans, M., Williamson, D., A general approximation technique for constrained forest problems (1995) SIAM Journal on Computing, 24, pp. 296-317; \n\nGrötschel, M., Lovász, L., Schrijver, A., (1988) Geometric Algorithms and Combinatorial Optimization, , Springer-Verlag, New York; \n\nJain, K., A factor 2 approximation algorithm for the generalized Steiner network problem (2001) Combinatorica, 21 (1), pp. 39-60. , Preliminary version in Proc. 39th IEEE FOCS, 1998; \n\nJain, K., Mandoiu, I., Vazirani, V.V., Williamson, D.P., A primal-dual schema based approximation algorithm for the element connectivity problem Proc. 10th Ann. ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 484-489; \n\nKhuller, S., Raghavachari, B., Improved approximation algorithms for uniform connectivity problems (1996) Journal of Algorithms, 21, pp. 434-450; \n\nKhuller, S., Vishkin, U., Biconnectivity approximations and graph carvings (1994) Journal of the ACM, 41 (2), pp. 214-235. , Preliminary version in Proc. 24th STOC, 1992; \n\nKortsarz, G., Nutov, Z., Approximating node connectivity problems via set covers (2000) Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, 1913, pp. 194-205. , (K. Jansen, S. Khuller (eds.)), Springer, LNCS; \n\nMader, W., Endlichkeitsätze für k-kristische Graphen (1977) Math. Ann., 229, pp. 143-153. , (German); \n\nMader, W., Connectivity and edge-connectivity in finite graphs (1979) Surveys in Combinatorics (Proc. Seventh British Combinatorial Conf., Cambridge, 1979), pp. 66-95. , London Math. Soc. Lecture Note Ser., 38, Cambridge Univ. Press, Cambridge-New York; \n\nMader, W., On k-critically n-connected graphs (1984) Progress in Graph Theory (Waterloo, Ont., 1982), pp. 389-398. , Academic Press, Toronto, ON; \n\nRavi, R., Williamson, D.P., An approximation algorithm for minimum-cost vertex-connectivity problems (1997) Algorithmica, 18, pp. 21-43. , (Preliminary version in Proc. 6th Ann. ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 332-341); \n\nTardos, E., A strongly polynomial algorithm to solve combinatorial linear programs (1986) Operations Research, 34, pp. 250-256", "hasCitationDuplums" : false, "userChangeableUntil" : "2015-05-14T11:07:12.000+0000", "publishDate" : "2015-05-14T11:05:43.000+0000", "directInstitutesForSort" : "", "ownerAuthorCount" : 3, "ownerInstituteCount" : 8, "directInstituteCount" : 0, "authorCount" : 3, "contributorCount" : 0, "book" : { "otype" : "Book", "mtid" : 30143389, "link" : "/api/publication/30143389", "label" : "Proceedings of the 34th Annual ACM Symposium on Theory of Computing. (2002)", "core" : false, "citation" : false, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 32, "link" : "/api/publicationtype/32", "label" : "Egyéb konferenciakötet", "code" : 32, "otypeName" : "Book", "listPosition" : 6, "published" : true, "oldId" : 32, "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" : "Proceedings of the 34th Annual ACM Symposium on Theory of Computing", "identifiers" : [ ], "publishedAt" : [ ], "publishedYear" : 2002, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : false, "conferencePublication" : true, "published" : true, "snippet" : true }, "hasQualityFactor" : false, "link" : "/api/publication/24739119", "label" : "Cheriyan J et al. Approximation algorithms for minimum-cost k-vertex connected subgraphs. (2002) Megjelent: Proceedings of the 34th Annual ACM Symposium on Theory of Computing pp. 306-312", "template" : "