{ "labelLang" : "hun", "responseDate" : "2024-03-29 03:15", "content" : { "otype" : "BookChapter", "mtid" : 22899857, "status" : "APPROVED", "published" : true, "unhandledTickets" : 0, "oldTimestamp" : "2018-09-14T08:33:37.000+0000", "deleted" : false, "oldId" : 12899857, "lastRefresh" : "2023-12-11T15:57:05.883+0000", "lastModified" : "2023-01-16T13:11:15.208+0000", "created" : "2013-01-30T09:02:25.000+0000", "creator" : { "otype" : "Author", "mtid" : 10012592, "link" : "/api/author/10012592", "label" : "Jordán Tibor (Kombinatorikus optimalizálás, gráfelmélet)", "familyName" : "Jordán", "givenName" : "Tibor", "published" : true, "oldId" : 10012592, "snippet" : true }, "duplumSearchResult" : { "id" : 4709034, "creationDate" : "2023-12-12T19:35:01.512+0000", "startDate" : "2023-12-12T19:35:01.713+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" : "2023-12-11T15:55:47.840+0000", "lastDuplumSearch" : "2023-12-12T19:35:01.713+0000", "adminApproved" : "2017-09-04T15:41:21.000+0000", "adminApprover" : { "otype" : "Admin", "mtid" : 10025948, "link" : "/api/admin/10025948", "label" : "Pécsi Éva (ELTE TTK kari adm INAKTÍV, admin)", "familyName" : "Pécsi", "givenName" : "Éva", "published" : true, "oldId" : 10025948, "snippet" : true }, "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" : "Kortsarz, G", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 21984061, "link" : "/api/authorship/21984061", "label" : "Kortsarz, G", "listPosition" : 1, "share" : 0.0, "first" : true, "last" : false, "familyName" : "Kortsarz", "givenName" : "G", "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" : 31988209, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 21984062, "link" : "/api/authorship/21984062", "label" : "Nutov, Z", "listPosition" : 2, "share" : 0.0, "first" : false, "last" : true, "familyName" : "Nutov", "givenName" : "Z", "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" : 31988208, "snippet" : true } ], "title" : "Approximation algorithm for k-node connected subgraphs via critical graphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 5819097, "link" : "/api/publicationidentifier/5819097", "label" : "Scopus: 4544293736", "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" : "NO", "idValue" : "4544293736", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-4544293736", "published" : false, "oldId" : 2940673, "snippet" : true } ], "firstPage" : "138", "lastPage" : "145", "firstPageOrInternalIdForSort" : "138", "pageLength" : 8, "publishedYear" : 2004, "digital" : null, "printed" : null, "sourceYear" : 2013, "packet" : "(Jordán Tibor (Kombinatorikus optimali...); 2013.01.30. 10:02:12)", "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "nationalOrigin" : null, "missingAuthor" : false, "oaType" : "NONE", "oaCheckDate" : "2023-12-11", "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" : 7, "citedCount" : 7, "references" : [ { "otype" : "Reference", "mtid" : 16376622, "link" : "/api/reference/16376622", "label" : "1. 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", "listPosition" : 1, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376623, "link" : "/api/reference/16376623", "label" : "2. Cheriyan, J., Jordán, T., Nutov, Z., On rooted node-connectivity problems (2001) Algorithmica, 30, pp. 353-375. , special issue on APPROX'98", "listPosition" : 2, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376624, "link" : "/api/reference/16376624", "label" : "3. Cheriyan, J., Thurimella, R., Approximating minimum-size k-connected spanning subgraphs via matching (2000) SIAM J. Comput., 30 (2), pp. 528-560", "listPosition" : 3, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376625, "link" : "/api/reference/16376625", "label" : "4. Cheriyan, J., Vempala, S., Vetta, A., Approximation algorithms for minimum-cost k-vertex connected subgraphs Proc. 34th ACM Symp. on Theory of Computing (STOC 2002), pp. 306-312", "listPosition" : 4, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376626, "link" : "/api/reference/16376626", "label" : "5. Frank, A., Connectivity augmentation problems in network design (1994) Mathematical Programming, pp. 34-63. , State of the Art, J. R. Birge and K. G. Murty eds", "listPosition" : 5, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376627, "link" : "/api/reference/16376627", "label" : "6. Frank, A., Jordán, T., Minimal edge-coverings of pairs of sets (1995) J. Comb. Theory B, 65, pp. 73-110", "listPosition" : 6, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376628, "link" : "/api/reference/16376628", "label" : "7. Frank, A., Tardos, É., An application of submodular flows (1989) Linear Algebra and Its Applications, 114-115, pp. 329-348", "listPosition" : 7, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376629, "link" : "/api/reference/16376629", "label" : "8. Gabow, H.N., A representation for crossing set families with application to submodular flow problems Proc. 4th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 1993), pp. 202-211", "listPosition" : 8, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376630, "link" : "/api/reference/16376630", "label" : "9. Graham, L., Grötschel, M., Lovász, L., (1995) Handbook of Combinatorics, 1. , Ch. 7", "listPosition" : 9, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376631, "link" : "/api/reference/16376631", "label" : "10. Jordán, T., On the optimal vertex-connectivity augmentation (1995) J. Combinatorial Theory Series B, 63, pp. 8-20", "listPosition" : 10, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376632, "link" : "/api/reference/16376632", "label" : "11. Jordán, T., On the existence of k, ℓ-critical graphs (1998) Discrete Math., 179 (1-3), pp. 273-275", "listPosition" : 11, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376633, "link" : "/api/reference/16376633", "label" : "12. Jackson, B., Jordán, T., A near optimal algorithm for vertex connectivity augmentation (2000) LNCS, 1969, pp. 212-325. , Proc. ISAAC 2000", "listPosition" : 12, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376634, "link" : "/api/reference/16376634", "label" : "13. Kortsarz, G., Nutov, Z., Approximating node connectivity problems via set covers (2003) Algorithmica, 37, pp. 75-92", "listPosition" : 13, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376635, "link" : "/api/reference/16376635", "label" : "14. Khuller, S., Raghavachari, B., Improved approximation algorithms for uniform connectivity problems (1996) J. of Algorithms, 21, pp. 434-450", "listPosition" : 14, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376636, "link" : "/api/reference/16376636", "label" : "15. Kriesell, M., Upper bounds to the number of vertices in a k-critically n-connected graph (2002) Graphs and Combinatorics, 18 (1), pp. 133-146", "listPosition" : 15, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376637, "link" : "/api/reference/16376637", "label" : "16. Mader, W., Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen (1972) Archive der Mathematik, 23, pp. 219-224", "listPosition" : 16, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376638, "link" : "/api/reference/16376638", "label" : "17. Mader, W., Minimal n-fach in minimalen n-fach zusammenhängenden Digraphen (1985) J. Combinatorial Theory Series B, 38, pp. 102-117", "listPosition" : 17, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376639, "link" : "/api/reference/16376639", "label" : "18. Mader, W., Endlichkeitsätze für k-kritische Graphen (German) (1977) Math. Ann., 229, pp. 143-153", "listPosition" : 18, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376640, "link" : "/api/reference/16376640", "label" : "19. Mader, W., On k-con-critically n-connected graphs (2002) J. Combin. Theory Ser. B, 86 (2), pp. 296-314", "listPosition" : 19, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376641, "link" : "/api/reference/16376641", "label" : "20. Mader, W., High connectivity keeping sets in n-connected graphs Combinatorica, , to appear in", "listPosition" : 20, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376642, "link" : "/api/reference/16376642", "label" : "21. Mader, W., Connectivity and edge-connectivity in finite graphs (1979) Surveys in Combinatorics (Proc. Seventh British Combinatorial Conf., Cambridge, 1979), 66 (95). , London Math. Soc. Lecture Notes Ser., 38, Cambridge Univ. Press", "listPosition" : 21, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376643, "link" : "/api/reference/16376643", "label" : "22. Mader, W., On k-critically n-connected graphs (1984) Progress in Graph Theory, pp. 389-398. , (Waterloo, Ont., 1982), Academic Press, Toronto, On", "listPosition" : 22, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376644, "link" : "/api/reference/16376644", "label" : "23. Maurer, B., Slater, P., On k-critical, n-connected graphs (1988) Discrete Mathematics, 20, pp. 255-262", "listPosition" : 23, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376645, "link" : "/api/reference/16376645", "label" : "24. Ravi, R., Williamson, D.P., An approximation algorithm for minimum-cost vertex-connectivity problems (1997) Algorithmica, 18, pp. 21-43", "listPosition" : 24, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376646, "link" : "/api/reference/16376646", "label" : "25. Ravi, R., Williamson, D.P., Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems (2002) Algorithmica, 34 (1), pp. 98-107", "listPosition" : 25, "published" : false, "snippet" : true }, { "otype" : "Reference", "mtid" : 16376647, "link" : "/api/reference/16376647", "label" : "26. Su, J., Proof of Slater's conjecture on k-critical n-connected graphs (1988) Kexue Tongbao (English Ed.), 33 (20), pp. 1675-1678", "listPosition" : 26, "published" : false, "snippet" : true } ], "hasCitationDuplums" : false, "userChangeableUntil" : "2017-09-04T15:41:21.000+0000", "publishDate" : "2013-01-30T09:05:16.000+0000", "directInstitutesForSort" : "", "ownerAuthorCount" : 3, "ownerInstituteCount" : 10, "directInstituteCount" : 0, "authorCount" : 2, "contributorCount" : 0, "book" : { "otype" : "Book", "mtid" : 3385102, "link" : "/api/publication/3385102", "label" : "Babai László. Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC ’04. (2004) ISBN:1581138520", "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" : "Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC ’04", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 804045, "link" : "/api/publicationidentifier/804045", "label" : "ISBN: 1581138520", "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" : "1581138520", "realUrl" : "https://www.worldcat.org/search?q=isbn%3A1581138520", "published" : false, "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" : 2004, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : false, "conferencePublication" : true, "published" : true, "oldId" : 3385102, "snippet" : true }, "hasQualityFactor" : false, "link" : "/api/publication/22899857", "label" : "Kortsarz G et al. Approximation algorithm for k-node connected subgraphs via critical graphs. (2004) Megjelent: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC ’04 pp. 138-145", "template" : "