{"id":"https://openalex.org/W1996261110","doi":"https://doi.org/10.1093/comjnl/bxs164","title":"LP-Based Approximation Algorithms for Reliable Resource Allocation","display_name":"LP-Based Approximation Algorithms for Reliable Resource Allocation","publication_year":2013,"publication_date":"2013-01-11","ids":{"openalex":"https://openalex.org/W1996261110","doi":"https://doi.org/10.1093/comjnl/bxs164","mag":"1996261110"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxs164","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxs164","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/journal_contribution/LP-based_approximation_algorithms_for_reliable_resource_allocation/28340150","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081316307","display_name":"Kewen Liao","orcid":"https://orcid.org/0000-0003-0371-6525"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"K. Liao","raw_affiliation_strings":["School of Computer Science, The University of Adelaide, SA 5005, Australia","1School of Computer Science, The University of Adelaide, SA 5005, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, The University of Adelaide, SA 5005, Australia","institution_ids":["https://openalex.org/I5681781"]},{"raw_affiliation_string":"1School of Computer Science, The University of Adelaide, SA 5005, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070128994","display_name":"Hong Shen","orcid":"https://orcid.org/0000-0002-3663-6591"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]},{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU","CN"],"is_corresponding":true,"raw_author_name":"H. Shen","raw_affiliation_strings":["School of Computer Science, The University of Adelaide, SA 5005, Australia","School of Information Science and Technology, Sun Yat-sen University, China","1School of Computer Science, The University of Adelaide, SA 5005, Australia","2School of Information Science and Technology, Sun Yat-sen University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, The University of Adelaide, SA 5005, Australia","institution_ids":["https://openalex.org/I5681781"]},{"raw_affiliation_string":"School of Information Science and Technology, Sun Yat-sen University, China","institution_ids":["https://openalex.org/I157773358"]},{"raw_affiliation_string":"1School of Computer Science, The University of Adelaide, SA 5005, Australia","institution_ids":["https://openalex.org/I5681781"]},{"raw_affiliation_string":"2School of Information Science and Technology, Sun Yat-sen University, China","institution_ids":["https://openalex.org/I157773358"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5070128994"],"corresponding_institution_ids":["https://openalex.org/I157773358","https://openalex.org/I5681781"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":0.4898,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.76357737,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"57","issue":"1","first_page":"154","last_page":"164"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9745000004768372,"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/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9664999842643738,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/computer-science","display_name":"Computer science","score":0.6434605717658997},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.597831666469574},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5810384750366211},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5272135734558105},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.493217408657074},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4610317051410675},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39531609416007996},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.367601215839386},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2932400405406952}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6434605717658997},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.597831666469574},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5810384750366211},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5272135734558105},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.493217408657074},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4610317051410675},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39531609416007996},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.367601215839386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2932400405406952},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1093/comjnl/bxs164","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxs164","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/91255","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/91255","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1093/comjnl/bxs164","raw_type":"Journal article"},{"id":"pmh:oai:figshare.com:article/28340150","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/LP-based_approximation_algorithms_for_reliable_resource_allocation/28340150","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},{"id":"pmh:oai:researchbank.swinburne.edu.au:220e4b29-1a4c-4537-960b-7ffb2516c9b2/1","is_oa":false,"landing_page_url":"http://hdl.handle.net/1959.3/440253","pdf_url":null,"source":{"id":"https://openalex.org/S4306401157","display_name":"Swinburne Research Bank (Swinburne University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I57093077","host_organization_name":"Swinburne University of Technology","host_organization_lineage":["https://openalex.org/I57093077"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Journal, Vol. 57, no. 1 (Jan 2014), pp. 154-164","raw_type":null}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/28340150","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/LP-based_approximation_algorithms_for_reliable_resource_allocation/28340150","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320321160","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4366983198","https://openalex.org/W2150694362","https://openalex.org/W2032499165","https://openalex.org/W2384924343","https://openalex.org/W2900612140","https://openalex.org/W2078602956","https://openalex.org/W2378616961","https://openalex.org/W2486227589","https://openalex.org/W2377867628","https://openalex.org/W2371490298"],"abstract_inverted_index":{"We":[0],"initiate":[1],"the":[2,5,95,100,147,181,191,202,209,217,255,275,292,317,345],"study":[3],"of":[4,19,27,52,94,102,146,170,173,208,228,235,291,326],"reliable":[6],"resource":[7,130,175],"allocation":[8,131,176],"(RRA)":[9],"problem.":[10,321,349],"In":[11,77,186,216],"this":[12,187,313],"problem,":[13,194],"we":[14,195,221,311,335],"are":[15,120,178,244,252,333],"given":[16],"a":[17,43,50,66,71,83,123,167,224,232,238,259,263,323,341],"set":[18,51,319],"sites":[20],"\u2131":[21,37],"each":[22,107],"with":[23,70],"an":[24,39,206],"unconstrained":[25,128],"number":[26,101],"facilities":[28,103,112],"as":[29],"resources.":[30],"Every":[31,60],"facility":[32,67,183,264,347],"at":[33,68,106,122],"site":[34,108],"i":[35,69,247],"\u2208":[36,63],"has":[38,82],"opening":[40],"cost":[41,73],"and":[42,74,109,136,140,154,211,230,250,273,282,298,331,355],"service":[44],"reliability":[45,75,85,257],"pi.":[46],"There":[47],"is":[48,97,166,205,265],"also":[49],"clients":[53,114],"\ud835\udc9e":[54,64],"to":[55,58,98,104,113,262,267,344],"be":[56],"allocated":[57],"facilities.":[59,91],"client":[61,80],"j":[62,81],"accesses":[65],"connection":[72],"lij.":[76],"addition,":[78],"every":[79],"minimum":[84,124,318],"requirement":[86],"(MRR)":[87],"rj":[88],"for":[89,189,315],"accessing":[90],"The":[92,127,269,285,350],"objective":[93],"problem":[96,132],"decide":[99],"open":[105],"connect":[110],"these":[111,174],"such":[115],"that":[116,258],"all":[117,329],"clients\u2019":[118],"MRRs":[119],"satisfied":[121],"total":[125],"cost.":[126],"fault-tolerant":[129],"studied":[133],"in":[134,213,280],"Liao":[135],"Shen":[137,283],"[(2011)":[138],"Unconstrained":[139],"Constrained":[141],"Fault-Tolerant":[142,286],"Resource":[143],"Allocation.":[144],"Proceedings":[145,290],"17th":[148],"Annual":[149],"International":[150,294],"Conference":[151],"on":[152,246,296],"Computing":[153],"Combinatorics":[155],"(COCOON),":[156],"Dallas,":[157],"Texas,":[158],"USA,":[159,303],"August":[160],"14\u201316,":[161],"pp.":[162,306],"555\u2013566.":[163],"Springer,":[164,308],"Berlin]":[165],"special":[168,324],"case":[169,325],"RRA.":[171],"Both":[172],"problems":[177],"derived":[179],"from":[180],"classical":[182],"location":[184,348],"theory.":[185],"paper,":[188],"solving":[190],"general":[192],"RRA":[193],"develop":[196],"two":[197],"equivalent":[198],"primal-dual":[199],"algorithms":[200],"where":[201,328],"second":[203],"one":[204],"acceleration":[207],"first":[210,222],"runs":[212],"quasi-quadratic":[214],"time.":[215],"algorithm's":[218],"ratio":[219,234,339],"analysis,":[220],"obtain":[223],"constant":[225],"approximation":[226,338],"factor":[227,239],"2+2\u221a2":[229],"then":[231],"reduced":[233],"3.722":[236],"using":[237],"revealing":[240],"program,":[241],"when":[242],"lij's":[243,332],"uniform":[245,253],"(partially":[248],"uniform)":[249],"rj's":[251,330],"above":[254],"threshold":[256],"single":[260],"access":[261],"able":[266],"provide.":[268],"analysis":[270],"further":[271],"elaborates":[272],"generalizes":[274],"inverse":[276],"dual-fitting":[277],"technique":[278,314],"introduced":[279],"Xu":[281],"[(2009)":[284],"Facility":[287],"Allocation":[288],"Problem.":[289],"20th":[293],"Symposium":[295],"Algorithms":[297],"Computation":[299],"(ISAAC),":[300],"Honolulu,":[301],"HI,":[302],"December":[304],"16\u201318,":[305],"689\u2013698.":[307],"Berlin].":[309],"Moreover,":[310],"formalize":[312],"analyzing":[316],"cover":[320],"For":[322],"RRA,":[327],"uniform,":[334],"derive":[336],"its":[337],"through":[340],"novel":[342],"reduction":[343,351],"uncapacitated":[346],"demonstrates":[352],"some":[353],"useful":[354],"generic":[356],"linear":[357],"programming":[358],"techniques.":[359]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}