{"id":"https://openalex.org/W1984337240","doi":"https://doi.org/10.1007/s00453-013-9841-9","title":"Asymptotically Optimal Online Page Migration on Three Points","display_name":"Asymptotically Optimal Online Page Migration on Three Points","publication_year":2013,"publication_date":"2013-10-16","ids":{"openalex":"https://openalex.org/W1984337240","doi":"https://doi.org/10.1007/s00453-013-9841-9","mag":"1984337240"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-013-9841-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-013-9841-9","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5052292825","display_name":"Akira Matsubayashi","orcid":"https://orcid.org/0000-0002-7861-4876"},"institutions":[{"id":"https://openalex.org/I10091056","display_name":"Kanazawa University","ror":"https://ror.org/02hwp6a56","country_code":"JP","type":"education","lineage":["https://openalex.org/I10091056"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Akira Matsubayashi","raw_affiliation_strings":["Division of Electrical Engineering and Computer Science, Kanazawa Univ., Kanazawa, 920-1192, Japan","Division of Electrical Engineering and Computer Science, Kanazawa Univ., Kanazawa, Japan 920-1192#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Electrical Engineering and Computer Science, Kanazawa Univ., Kanazawa, 920-1192, Japan","institution_ids":["https://openalex.org/I10091056"]},{"raw_affiliation_string":"Division of Electrical Engineering and Computer Science, Kanazawa Univ., Kanazawa, Japan 920-1192#TAB#","institution_ids":["https://openalex.org/I10091056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052292825"],"corresponding_institution_ids":["https://openalex.org/I10091056"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":1.1727,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.83303842,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"71","issue":"4","first_page":"1035","last_page":"1064"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T11478","display_name":"Caching and Content Delivery","score":0.9721999764442444,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9496999979019165,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7753373384475708},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.687374472618103},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.672716498374939},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6708313226699829},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.6129506230354309},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5685330033302307},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5141558647155762},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49404340982437134},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48806560039520264},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48291015625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4389728605747223},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4388345181941986},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.432813823223114},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4118781089782715},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32613563537597656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31199324131011963}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7753373384475708},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.687374472618103},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.672716498374939},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6708313226699829},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.6129506230354309},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5685330033302307},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5141558647155762},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49404340982437134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48806560039520264},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48291015625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4389728605747223},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4388345181941986},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.432813823223114},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4118781089782715},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32613563537597656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31199324131011963},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-013-9841-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-013-9841-9","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.8100000023841858}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1486124781","https://openalex.org/W1552828154","https://openalex.org/W1972442117","https://openalex.org/W2007513370","https://openalex.org/W2011670396","https://openalex.org/W2030810980","https://openalex.org/W2049943172","https://openalex.org/W2053265764","https://openalex.org/W2058506754","https://openalex.org/W2069255833","https://openalex.org/W2075784392","https://openalex.org/W2092340542","https://openalex.org/W2103253701","https://openalex.org/W2111799297"],"related_works":["https://openalex.org/W4299302777","https://openalex.org/W2777812223","https://openalex.org/W1996806106","https://openalex.org/W2058681277","https://openalex.org/W1772565852","https://openalex.org/W2922865928","https://openalex.org/W2951573806","https://openalex.org/W4383557903","https://openalex.org/W2964121702","https://openalex.org/W2567853751"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}