{"id":"https://openalex.org/W4313647352","doi":"https://doi.org/10.1142/s0129054122500265","title":"Online and Approximate Network Construction from Bounded Connectivity Constraints","display_name":"Online and Approximate Network Construction from Bounded Connectivity Constraints","publication_year":2023,"publication_date":"2023-01-06","ids":{"openalex":"https://openalex.org/W4313647352","doi":"https://doi.org/10.1142/s0129054122500265"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054122500265","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s0129054122500265","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5060626918","display_name":"Jesper Jansson","orcid":"https://orcid.org/0000-0001-6859-8932"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Jesper Jansson","raw_affiliation_strings":["Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan","institution_ids":["https://openalex.org/I22299242"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005407145","display_name":"Christos Levcopoulos","orcid":"https://orcid.org/0000-0003-0983-7862"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Christos Levcopoulos","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, 22100 Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, 22100 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016509031","display_name":"Andrzej Lingas","orcid":"https://orcid.org/0000-0003-4998-9844"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Andrzej Lingas","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, 22100 Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, 22100 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016509031"],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":null,"apc_paid":null,"fwci":0.202,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48679566,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"34","issue":"05","first_page":"453","last_page":"468"},"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.9991999864578247,"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.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991999864578247,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9855999946594238,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.694767415523529},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6515339016914368},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5821871757507324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5690340399742126},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5502290725708008},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47161558270454407},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.43598854541778564},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.434050589799881},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.42277365922927856},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4148562550544739},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24984100461006165},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.10963627696037292}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.694767415523529},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6515339016914368},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5821871757507324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5690340399742126},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5502290725708008},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47161558270454407},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.43598854541778564},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.434050589799881},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.42277365922927856},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4148562550544739},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24984100461006165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.10963627696037292},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054122500265","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s0129054122500265","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:lup.lub.lu.se:9366de5b-711e-4ab3-87b0-298dc9fdcced","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/9366de5b-711e-4ab3-87b0-298dc9fdcced","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 0129-0541","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1688881401","display_name":null,"funder_award_id":"621-2017-03750","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G6119232709","display_name":null,"funder_award_id":"2H03550","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1973394376","https://openalex.org/W1975218943","https://openalex.org/W2023946466","https://openalex.org/W2026727471","https://openalex.org/W2038225707","https://openalex.org/W2050339304","https://openalex.org/W2058702473","https://openalex.org/W2064600658","https://openalex.org/W2074121653","https://openalex.org/W2088188524","https://openalex.org/W2115404728","https://openalex.org/W2137118456"],"related_works":["https://openalex.org/W2564742953","https://openalex.org/W4213299358","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2970577745","https://openalex.org/W2583614279","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"The":[0,232],"Network":[1,261,299,334],"Construction":[2,262,300,335],"problem,":[3,301],"studied":[4],"by":[5,206],"Angluin":[6,275],"et":[7,10,270,276],"al.,":[8,11],"Hosoda":[9,269],"and":[12,64,101,127,144,172,278,353],"others,":[13],"asks":[14],"for":[15,52,211,258,332],"a":[16,20,43,65,78,92,254,290,308,326],"minimum-cost":[17],"network":[18,33],"satisfying":[19],"set":[21,44,79],"of":[22,28,48,58,70,83,95,105,161,170,175,268,274,281,293,314,357],"connectivity":[23,71,295],"constraints":[24,171],"which":[25],"specify":[26],"subsets":[27],"the":[29,32,73,96,102,114,159,168,173,179,201,207,215,259,282,294,298,311,333,338,355],"vertices":[30,59],"in":[31,200,297],"that":[34,86,129,184],"have":[35,130],"to":[36,76,285,306],"form":[37],"connected":[38,93],"subgraphs.":[39],"More":[40],"formally,":[41],"given":[42],"[Formula:":[45,61,67,80,88,98,106,141,145,151,164,186,195,224,318,328,339,349],"see":[46,62,68,81,89,99,107,142,146,152,165,187,196,225,319,329,340,350],"text]":[47,69,82,90,100,108,153,166,351],"vertices,":[49,176,352],"construction":[50],"costs":[51],"all":[53],"possible":[54],"edges":[55,84,128],"between":[56],"pairs":[57],"from":[60],"text],":[63],"sequence":[66],"constraints,":[72,162,220],"objective":[74],"is":[75,109,154,235],"find":[77],"such":[85],"each":[87,303,344],"induces":[91],"subgraph":[94,309],"graph":[97],"total":[103],"cost":[104],"minimized.":[110],"First,":[111],"we":[112,182,221,252,288,324],"study":[113],"online":[115],"version":[116],"where":[117,150,302],"every":[118],"constraint":[119,304,345],"must":[120],"be":[121,136],"satisfied":[122],"immediately":[123],"after":[124],"its":[125],"arrival":[126],"already":[131],"been":[132],"added":[133],"can":[134],"never":[135],"removed.":[137],"We":[138],"give":[139],"an":[140,155,185,194,223,237,248,265,279],"text]-competitive":[143,147,188,197,226],"polynomial-time":[148,327],"algorithms,":[149],"upper":[156,227],"bound":[157,190,199,228,234],"on":[158],"size":[160],"while":[163,240],"denote":[167],"number":[169,174],"respectively.":[177],"On":[178],"other":[180,242,322],"hand,":[181],"observe":[183],"lower":[189,198,209],"as":[191,193],"well":[192],"cost-uniform":[202,216],"case":[203,217],"are":[204,246],"implied":[205],"known":[208],"bounds":[210,245],"unbounded":[212,219],"constraints.":[213],"For":[214],"with":[218,229,272,337],"provide":[222,325],"high":[230],"probability.":[231],"latter":[233],"against":[236,247],"oblivious":[238],"adversary":[239],"our":[241],"randomized":[243],"competitive":[244],"adaptive":[249],"adversary.":[250],"Next,":[251],"discuss":[253],"hybrid":[255,283],"approximation":[256,266],"method":[257,284],"(offline)":[260],"problem":[263,336],"combining":[264],"algorithm":[267,331],"al.":[271,277],"one":[273],"application":[280],"bioinformatics.":[286],"Finally,":[287],"consider":[289],"natural":[291],"strengthening":[292],"requirements":[296],"has":[305,346],"induce":[307],"(of":[310],"constructed":[312],"graph)":[313],"diameter":[315],"at":[316,347],"most":[317,348],"text].":[320],"Among":[321],"things,":[323],"text]-approximation":[330],"text]-diameter":[341],"requirements,":[342],"when":[343],"show":[354],"APX-completeness":[356],"this":[358],"variant.":[359]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-22T23:10:17.713674","created_date":"2025-10-10T00:00:00"}