{ "labelLang" : "hun", "responseDate" : "2024-03-29 14:58", "content" : { "otype" : "BookChapter", "mtid" : 31419526, "status" : "VALIDATED", "published" : true, "unhandledTickets" : 0, "deleted" : false, "lastRefresh" : "2024-02-14T14:32:25.031+0000", "lastModified" : "2020-09-11T07:00:18.209+0000", "created" : "2020-08-25T20:17:41.849+0000", "creator" : { "otype" : "Admin", "mtid" : 565, "link" : "/api/admin/565", "label" : "WoS import (admin)", "familyName" : "WoS", "givenName" : "import", "published" : true, "snippet" : true }, "lastDuplumOK" : "2023-12-12T12:23:05.841+0000", "lastDuplumSearch" : "2023-12-12T12:23:05.841+0000", "validated" : "2020-09-11T07:00:18.219+0000", "validator" : { "otype" : "Admin", "mtid" : 10065569, "link" : "/api/admin/10065569", "label" : "Pécsi Éva (MTMT Közp 3, admin)", "familyName" : "Pécsi", "givenName" : "Éva", "published" : true, "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" : "Nutov, Zeev", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 92405637, "link" : "/api/authorship/92405637", "label" : "Nutov, Zeev ✉", "listPosition" : 1, "share" : 0.0, "first" : true, "last" : false, "corresponding" : true, "familyName" : "Nutov", "givenName" : "Zeev", "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, "snippet" : true } ], "title" : "A 4+epsilon approximation for k-connected subgraphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 17162135, "link" : "/api/publicationidentifier/17162135", "label" : "WoS: 000554408101004", "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" : "IDENTICAL", "idValue" : "000554408101004", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000554408101004", "published" : false, "snippet" : true } ], "firstPage" : "1000", "lastPage" : "1009", "firstPageOrInternalIdForSort" : "1000", "pageLength" : 10, "publishedYear" : 2020, "abstractText" : "We obtain approximation ratio 4 + 2/l approximate to 4 + 4lg k/lg n-lg k for the (undirected) k-CONNECTED SUBGRAPH problem, where l = [lg n-lg k+1/2 lg k+1] is the largest integer such that 2(l-1)k(2l+1)<= n. For large values of n this improves the ratio 6 of Cheriyan and Vegh [4] when n >= k(3) (the case l = 1). Our result implies an fpt-approximation ratio 4 + epsilon that matches (up to the \"+epsilon\" term) the best known ratio 4 for k = 6, 7 for both the general and the easier augmentation versions of the problem. Similar results are shown for the problem of covering an arbitrary crossing supermodular biset function.", "digital" : null, "printed" : null, "sourceYear" : 2020, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "nationalOrigin" : null, "missingAuthor" : false, "oaType" : "NONE", "oaCheckDate" : "2024-02-14", "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" : 8, "citedCount" : 8, "hasCitationDuplums" : false, "userChangeableUntil" : "2020-09-10T07:00:17.644+0000", "directInstitutesForSort" : "", "ownerAuthorCount" : 6, "ownerInstituteCount" : 18, "directInstituteCount" : 0, "authorCount" : 1, "contributorCount" : 0, "book" : { "otype" : "Book", "mtid" : 31411106, "link" : "/api/publication/31411106", "label" : "Chawla Shuchi. PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20). (2020)", "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 THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20)", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 20294305, "link" : "/api/publicationidentifier/20294305", "label" : "Egyéb katalógus: https://www.tib.eu/de/suchen/id/TIBKAT:1734521066", "source" : { "otype" : "PlainSource", "mtid" : 140, "link" : "/api/publicationsource/140", "label" : "Egyéb katalógus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10005, "link" : "/api/publicationsourcetype/10005", "label" : "Könyvtári katalógus", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Egyéb katalógus", "linkPattern" : "@@@", "publiclyVisible" : true, "published" : true, "oldId" : 140, "snippet" : true }, "idValue" : "https://www.tib.eu/de/suchen/id/TIBKAT:1734521066", "realUrl" : "https://www.tib.eu/de/suchen/id/TIBKAT:1734521066", "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 } ], "pageLength" : 3045, "publishedYear" : 2020, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : false, "conferencePublication" : true, "published" : true, "snippet" : true }, "hasQualityFactor" : false, "link" : "/api/publication/31419526", "label" : "Nutov Zeev. A 4+epsilon approximation for k-connected subgraphs. (2020) Megjelent: PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20) pp. 1000-1009", "template" : "