{"id":"https://openalex.org/W7154349080","doi":"https://doi.org/10.48550/arxiv.2604.10801","title":"New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs","display_name":"New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs","publication_year":2026,"publication_date":"2026-04-12","ids":{"openalex":"https://openalex.org/W7154349080","doi":"https://doi.org/10.48550/arxiv.2604.10801"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.10801","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.10801","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.10801","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090388227","display_name":"Sophia Heck","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Heck, Sophia","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5007555796","display_name":"Eleni C. Akrida","orcid":"https://orcid.org/0000-0002-1126-1623"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Akrida, Eleni","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.4796000123023987,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.4796000123023987,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.10279999673366547,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.07900000363588333,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.804099977016449},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7926999926567078},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6082000136375427},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.539900004863739},{"id":"https://openalex.org/keywords/snapshot","display_name":"Snapshot (computer storage)","score":0.4690000116825104},{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.4180000126361847},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.40779998898506165},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.40059998631477356}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.804099977016449},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7926999926567078},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6082000136375427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.578499972820282},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.539900004863739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4878000020980835},{"id":"https://openalex.org/C55282118","wikidata":"https://www.wikidata.org/wiki/Q252683","display_name":"Snapshot (computer storage)","level":2,"score":0.4690000116825104},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.4180000126361847},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.40779998898506165},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.40059998631477356},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.38440001010894775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.351500004529953},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3506999909877777},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.3325999975204468},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33239999413490295},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3091999888420105},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30160000920295715},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.26750001311302185},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C77277458","wikidata":"https://www.wikidata.org/wiki/Q1969246","display_name":"Temporal database","level":2,"score":0.2578999996185303},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.2542000114917755},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.10801","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.10801","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.10801","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.10801","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Modern":[0],"networks":[1],"are":[2,65],"highly":[3],"dynamic,":[4],"and":[5,42,128,136,146,155,164,213],"temporal":[6,35,74,97,124,184],"graphs":[7,185],"capture":[8],"these":[9],"changes":[10],"through":[11],"discrete":[12],"edge":[13,52],"appearances":[14],"on":[15,94,121,179,210],"a":[16,79,82,239],"fixed":[17],"vertex":[18],"set,":[19],"known":[20,194],"in":[21,62,109,197,201,227,234,253],"advance":[22],"up":[23],"to":[24,33],"the":[25,34,59,152,171,188,193,216,221,235,243,256],"graph's":[26],"lifetime.":[27],"The":[28],"Vertex":[29,39,46],"Cover":[30,40,47],"problem":[31],"extends":[32],"setting":[36],"as":[37,232],"Temporal":[38,45],"(TVC)":[41],"Sliding":[43],"Window":[44],"(SW-TVC).":[48],"In":[49,71],"TVC,":[50],"each":[51,76,88],"is":[53,78,92,170],"covered":[54,66],"by":[55,104],"one":[56],"endpoint":[57],"over":[58],"lifetime,":[60],"while":[61],"SW-TVC,":[63],"edges":[64],"within":[67],"every":[68],"$\u0394$-step":[69],"window.":[70],"always":[72,95,122,182],"star":[73,80,96,123,183],"graphs,":[75,98,125],"snapshot":[77],"with":[81,132,162],"center":[83],"that":[84,187,215],"may":[85],"change":[86],"at":[87],"time":[89,229],"step.":[90],"TVC":[91],"NP-complete":[93],"but":[99],"an":[100],"FPT":[101],"algorithm":[102,219,226,246],"parameterized":[103],"$\u0394$":[105],"solves":[106],"it":[107],"optimally":[108],"$O(T\u0394(n+m)\\cdot":[110],"2^\u0394)$.":[111],"This":[112],"paper":[113],"presents":[114],"two":[115],"polynomial-time":[116],"approximation":[117,130,160,166,190,196,218,225,245,258],"algorithms":[118,140,161,191,209],"for":[119,144],"SW-TVC":[120],"achieving":[126],"$2\u0394-1$":[127],"$\u0394-1$":[129],"ratios":[131],"running":[133,198,228],"times":[134],"$O(T)$":[135],"$O(Tm\u0394^2)$,":[137],"respectively.":[138],"These":[139],"provide":[141],"exact":[142],"solutions":[143],"$\u0394=1$":[145],"$\u0394\\leq":[147],"2$.":[148],"Additionally,":[149],"we":[150],"offer":[151],"first":[153],"implementation":[154,241],"experimental":[156],"evaluation":[157],"of":[158,174,242],"state-of-the-art":[159,208],"$d$":[163,169,224,244],"$d-1$":[165,195,217,252,257],"ratios,":[167],"where":[168,204],"maximum":[172],"degree":[173],"any":[175],"snapshot.":[176],"Our":[177],"experiments":[178],"artificially":[180],"generated":[181],"show":[186],"new":[189],"outperform":[192],"time,":[199],"even":[200],"some":[202],"cases":[203],"$\u0394>d$.":[205],"We":[206],"test":[207],"real-world":[211],"data":[212],"observe":[214],"outperforms":[220],"analytically":[222],"better":[223],"when":[230],"implemented":[231],"described":[233],"original":[236],"paper.":[237],"However,":[238],"novel":[240],"significantly":[247],"improves":[248],"its":[249],"runtime,":[250],"surpassing":[251],"practice.":[254],"Nonetheless,":[255],"consistently":[259],"computes":[260],"smaller":[261],"solutions.":[262]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-15T00:00:00"}