{"id":"https://openalex.org/W7162469835","doi":"https://doi.org/10.48550/arxiv.2605.24711","title":"Covering vertices by sequential stars","display_name":"Covering vertices by sequential stars","publication_year":2026,"publication_date":"2026-05-23","ids":{"openalex":"https://openalex.org/W7162469835","doi":"https://doi.org/10.48550/arxiv.2605.24711"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.24711","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.24711","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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.2605.24711","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5106454696","display_name":"Mengyuan Hu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hu, Mengyuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137022062","display_name":"An Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, An","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136999120","display_name":"Yong Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Yong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137061848","display_name":"Zhikai Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Zhikai","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137028482","display_name":"Wei Ding","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ding, Wei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137064819","display_name":"Guohui Lin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lin, Guohui","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137017818","display_name":"Jiaxuan Ma","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ma, Jiaxuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137068501","display_name":"Yue Sun","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sun, Yue","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7099999785423279,"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.7099999785423279,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.10649999976158142,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.05590000003576279,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5058000087738037},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4781999886035919},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44130000472068787},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.40610000491142273},{"id":"https://openalex.org/keywords/stars","display_name":"Stars","score":0.3467999994754791},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.3409999907016754},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.32429999113082886}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6248000264167786},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5996999740600586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5311999917030334},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5058000087738037},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4781999886035919},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44130000472068787},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.40610000491142273},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39579999446868896},{"id":"https://openalex.org/C150846664","wikidata":"https://www.wikidata.org/wiki/Q7602306","display_name":"Stars","level":2,"score":0.3467999994754791},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.3409999907016754},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.32429999113082886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.311599999666214},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3046000003814697},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.25929999351501465},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.25839999318122864},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2583000063896179},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.24711","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.24711","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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.2605.24711","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.24711","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":[{"display_name":"Sustainable cities and communities","score":0.5947360992431641,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,6,78,86,105,126,134,149,167,193,208],"problem":[3,194],"of":[4,9,17,24,109,130],"covering":[5],"maximum":[7],"number":[8,23],"vertices":[10],"in":[11,26,57],"a":[12,15,22,27,92,113,188],"graph":[13],"by":[14],"collection":[16],"vertex-disjoint":[18],"stars,":[19],"each":[20],"with":[21,175],"satellites":[25],"given":[28],"interval":[29],"$[k,":[30,50],"\\ell]$,":[31],"where":[32,212],"$1":[33],"\\le":[34,162],"k":[35,144,163],"<":[36,145,164],"\\ell$":[37],"and":[38,100,121,147],"$\\ell$":[39],"can":[40],"be":[41],"infinity.":[42],"This":[43],"is":[44,55],"referred":[45],"to":[46,182],"as":[47],"sequential":[48,89],"{\\sc":[49],"\\ell]$-Star":[51],"Packing}":[52],"problem.":[53],"It":[54],"solvable":[56],"polynomial":[58],"time":[59],"when":[60,68,96,117,141,160,199],"$k":[61,69,97,118,200,213],"=":[62,102,119,123,143,214],"1$,":[63],"but":[64],"becomes":[65],"strongly":[66],"NP-hard":[67],"\\ge":[70,98,201],"2$.":[71,215],"In":[72],"this":[73],"paper,":[74],"we":[75,178,203],"propose":[76],"either":[77],"first":[79,135,150],"or":[80],"an":[81],"improved":[82],"approximation":[83],"algorithm":[84,95,116,140,159],"for":[85,187,207],"following":[87],"four":[88],"settings:":[90],"1)":[91],"$\\frac":[93,110,114,131],"{k+1}2$-approximation":[94],"3$":[99],"$\\ell":[101,122],"\\infty$,":[103,124],"improving":[104,125],"previous":[106,127],"best":[107,128],"ratio":[108,129],"{(k+1)^2}{2k+1}$;":[111],"2)":[112],"43$-approximation":[115],"2$":[120],"32$;":[132],"3)":[133],"$(1":[136,151],"+":[137,152],"\\frac":[138,155],"\\ell{\\ell+1})$-approximation":[139],"$2":[142],"\\ell$;":[146],"4)":[148],"\\max\\left\\{\\frac":[153],"{k-1}2,":[154],"{(k+1)":[156],"\\ell}{3":[157],"(\\ell+1)}\\right\\})$-approximation":[158],"$3":[161],"\\ell$.":[165],"Besides":[166],"main":[168],"algorithmic":[169],"techniques":[170],"being":[171],"local":[172,189],"search":[173],"coupled":[174],"amortized":[176],"analysis,":[177],"observe":[179],"augmenting":[180],"configurations":[181],"bridge":[183],"two":[184],"distant":[185],"neighborhoods":[186],"improvement":[190],"operation.":[191],"Additionally,":[192],"has":[195],"been":[196],"shown":[197],"APX-hard":[198],"3$;":[202],"prove":[204],"its":[205],"APX-hardness":[206],"last":[209],"remaining":[210],"case":[211]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-27T00:00:00"}