{"id":"https://openalex.org/W2788168460","doi":"https://doi.org/10.1142/s0129054117500320","title":"Approximation Algorithm for Resource Allocation Problems with Time Dependent Penalties","display_name":"Approximation Algorithm for Resource Allocation Problems with Time Dependent Penalties","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2788168460","doi":"https://doi.org/10.1142/s0129054117500320","mag":"2788168460"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054117500320","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117500320","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/A5102782980","display_name":"Vaishali Mehta Wadhwa","orcid":"https://orcid.org/0000-0003-2017-0528"},"institutions":[{"id":"https://openalex.org/I162030827","display_name":"Thapar Institute of Engineering & Technology","ror":"https://ror.org/00wdq3744","country_code":"IN","type":"education","lineage":["https://openalex.org/I162030827"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Vaishali M. Wadhwa","raw_affiliation_strings":["Computer Science and Engineering Department, Thapar University, Patiala, Punjab 147001, India"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, Thapar University, Patiala, Punjab 147001, India","institution_ids":["https://openalex.org/I162030827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080945795","display_name":"Deepak Garg","orcid":"https://orcid.org/0000-0002-7243-3599"},"institutions":[{"id":"https://openalex.org/I3129773123","display_name":"Bennett University","ror":"https://ror.org/00an5hx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I3129773123"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Deepak Garg","raw_affiliation_strings":["Department of Computer Science and Engineering, Bennett University, Greater Noida 201310, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Bennett University, Greater Noida 201310, India","institution_ids":["https://openalex.org/I3129773123"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102782980"],"corresponding_institution_ids":["https://openalex.org/I162030827"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25879855,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"28","issue":"07","first_page":"931","last_page":"943"},"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.9997000098228455,"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.9997000098228455,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9878000020980835,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9692000150680542,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7335325479507446},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6490898132324219},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6220091581344604},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.6085436344146729},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5463665723800659},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5295038223266602},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5212981700897217},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.46258115768432617},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.45971181988716125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4525451362133026},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4311411380767822},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.42478105425834656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41904351115226746},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07247337698936462}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7335325479507446},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6490898132324219},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6220091581344604},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.6085436344146729},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5463665723800659},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5295038223266602},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5212981700897217},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.46258115768432617},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45971181988716125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4525451362133026},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4311411380767822},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.42478105425834656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41904351115226746},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07247337698936462},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054117500320","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117500320","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W113414296","https://openalex.org/W1964276725","https://openalex.org/W1973529814","https://openalex.org/W1978117135","https://openalex.org/W1983553101","https://openalex.org/W1987503114","https://openalex.org/W1988593260","https://openalex.org/W2000500966","https://openalex.org/W2003719999","https://openalex.org/W2011232221","https://openalex.org/W2052494364","https://openalex.org/W2076746184","https://openalex.org/W2083653011","https://openalex.org/W2083833523","https://openalex.org/W2101622070","https://openalex.org/W2177090493","https://openalex.org/W2608158342","https://openalex.org/W4243637616"],"related_works":["https://openalex.org/W4256416014","https://openalex.org/W2280623698","https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W1973529814","https://openalex.org/W1509863433","https://openalex.org/W4299354108"],"abstract_inverted_index":{"The":[0],"Resource":[1],"Allocation":[2],"Problem":[3],"with":[4,53],"Time":[5],"Dependent":[6],"Penalties":[7],"(RAPTP)":[8],"is":[9,35,80,147,156,184,187,193],"a":[10,58,144,162,168,180],"variant":[11],"of":[12,40,101,176],"uncapacitated":[13,20,25],"resource":[14,127],"allocation":[15,22],"problems":[16,23,52],"generally":[17],"referred":[18],"as":[19,76],"facility":[21,26,50,125],"or":[24,126],"location":[27,51],"problem":[28,109],"(UFLP).":[29],"Work":[30],"done":[31],"in":[32,46],"this":[33,108],"paper":[34,64],"motivated":[36],"by":[37,83,143,161],"the":[38,174,194],"work":[39],"Du,":[41],"Lu":[42],"and":[43,56,79,92,99,192],"Xu":[44],"[7]":[45],"which":[47,134,186],"authors":[48],"considered":[49,112,148],"submodular":[54],"penalties":[55],"presented":[57],"3-approximation":[59],"primal":[60],"dual":[61],"algorithm.":[62],"This":[63],"considers":[65],"that":[66,74,150,158],"each":[67],"unallocated":[68],"demand":[69,102,118,145,163],"point":[70,103,146,164],"adds":[71],"to":[72,123],"penalty":[73,141,159],"increases":[75],"time":[77,98,131,177],"passes":[78],"thus":[81],"represented":[82],"function":[84],"[Formula:":[85,89,93,104],"see":[86,90,94,105],"text]":[87,91,95],"where":[88],"are":[96],"elapse":[97],"priority":[100],"text].":[106],"As":[107],"has":[110],"been":[111],"for":[113,199],"emergency":[114],"service":[115],"allocation,":[116],"all":[117],"points":[119],"should":[120],"be":[121],"allocated":[122],"some":[124,129],"within":[128],"stipulated":[130],"limit":[132],"beyond":[133],"it":[135,155],"may":[136],"lose":[137],"its":[138],"purpose.":[139],"Thus":[140,154],"incurred":[142],"till":[149],"threshold":[151,170],"value":[152],"only.":[153],"assumed":[157],"contribution":[160],"remains":[165],"constant":[166],"after":[167],"specified":[169],"value.":[171],"By":[172],"exploiting":[173],"properties":[175],"dependent":[178],"penalties,":[179],"4-approximation":[181],"primal-dual":[182],"algorithm":[183,198],"proposed":[185],"based":[188],"on":[189],"LP":[190],"framework,":[191],"first":[195],"constant-factor":[196],"approximation":[197],"RAPTP.":[200]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}