{"id":"https://openalex.org/W4407301446","doi":"https://doi.org/10.1145/3716551","title":"Some Results on Approximability of Minimum Sum Vertex Cover","display_name":"Some Results on Approximability of Minimum Sum Vertex Cover","publication_year":2025,"publication_date":"2025-02-10","ids":{"openalex":"https://openalex.org/W4407301446","doi":"https://doi.org/10.1145/3716551"},"language":"en","primary_location":{"id":"doi:10.1145/3716551","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3716551","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055086773","display_name":"Aleksa Stankovi\u0107","orcid":"https://orcid.org/0000-0002-8416-8665"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Aleksa Stankovic","raw_affiliation_strings":["Institutionen f\u00f6r Matematik, KTH Royal Institute of Technology, Stockholm, Sweden","No address"],"raw_orcid":"https://orcid.org/0000-0002-8416-8665","affiliations":[{"raw_affiliation_string":"Institutionen f\u00f6r Matematik, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"No address","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055086773"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":0.7964,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.71398231,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"17","issue":"2","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8005453944206238},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6486021876335144},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6243530511856079},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6082352995872498},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5722573399543762},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5006635189056396},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37971416115760803},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.2748713493347168},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19801148772239685},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.054715901613235474}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8005453944206238},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6486021876335144},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6243530511856079},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6082352995872498},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5722573399543762},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5006635189056396},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37971416115760803},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2748713493347168},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19801148772239685},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.054715901613235474},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3716551","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3716551","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1491127810","https://openalex.org/W1524356573","https://openalex.org/W1576805635","https://openalex.org/W1973571353","https://openalex.org/W2014086530","https://openalex.org/W2087038607","https://openalex.org/W2110871651","https://openalex.org/W2120358419","https://openalex.org/W2127816126","https://openalex.org/W2134331592","https://openalex.org/W2137118456","https://openalex.org/W2148352980","https://openalex.org/W2152490496","https://openalex.org/W2977701101","https://openalex.org/W3089570856","https://openalex.org/W4205429199","https://openalex.org/W4233413206","https://openalex.org/W4313462279"],"related_works":["https://openalex.org/W2949255922","https://openalex.org/W2036594069","https://openalex.org/W4244658307","https://openalex.org/W2156896570","https://openalex.org/W2038655901","https://openalex.org/W1627181101","https://openalex.org/W2043560626","https://openalex.org/W1558145674","https://openalex.org/W1566660502","https://openalex.org/W2907689753"],"abstract_inverted_index":{"We":[0,138,166],"study":[1,140],"the":[2,20,31,45,54,59,63,66,73,80,95,102,141,158,177],"Minimum":[3,88,103,118,142,187],"Sum":[4,89,104,119,143,188],"Vertex":[5,90,105,120,144,189],"Cover":[6,106,121,145,190],"problem,":[7],"which":[8],"asks":[9],"for":[10,40,87,117,172],"an":[11,37,169],"ordering":[12,60],"of":[13,24,30,53,65,84,123,179],"vertices":[14,29],"in":[15,72,155,176],"a":[16,129],"graph":[17,32],"that":[18,61,101,154,186],"minimizes":[19,62],"total":[21],"cover":[22,67],"time":[23,47],"edges.":[25],"In":[26,75,92,150],"particular,":[27,93,151],"n":[28],"are":[33],"visited":[34],"according":[35],"to":[36,57,128,162,184],"ordering,":[38],"and":[39,136,182],"each":[41],"edge":[42],"this":[43,76,156],"induces":[44],"first":[46,81],"it":[48],"is":[49,56,125,160],"covered.":[50],"The":[51,113],"goal":[52],"problem":[55,107,146,159],"find":[58],"sum":[64],"times":[68],"over":[69],"all":[70],"edges":[71],"graph.":[74],"work,":[77],"we":[78,99,152],"give":[79],"explicit":[82],"hardness":[83],"approximation":[85,115,170],"result":[86],"Cover.":[91],"assuming":[94],"Unique":[96],"Games":[97],"Conjecture,":[98],"show":[100,153,185],"cannot":[108],"be":[109,192],"approximated":[110,193],"within":[111,164,194],"1.0748.":[112],"best":[114],"ratio":[116],"as":[122],"now":[124],"16/9,":[126],"due":[127],"recent":[130],"work":[131,178],"by":[132],"Bansal,":[133],"Batra,":[134],"Farhadi,":[135],"Tetali.":[137],"also":[139,167],"on":[147,196],"regular":[148,173,197],"graphs.":[149,198],"case":[157],"hard":[161],"approximate":[163],"1.0157.":[165],"revisit":[168],"algorithm":[171],"graphs":[174],"outlined":[175],"Feige,":[180],"Lov\u00e1sz,":[181],"Tetali":[183],"can":[191],"1.225":[195]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}