{"id":"https://openalex.org/W2012240101","doi":"https://doi.org/10.1145/2684464.2684495","title":"Polyhedral Approach for Lifetime Maximization of Target Coverage Problem","display_name":"Polyhedral Approach for Lifetime Maximization of Target Coverage Problem","publication_year":2015,"publication_date":"2015-01-04","ids":{"openalex":"https://openalex.org/W2012240101","doi":"https://doi.org/10.1145/2684464.2684495","mag":"2012240101"},"language":"en","primary_location":{"id":"doi:10.1145/2684464.2684495","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2684464.2684495","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","raw_type":"proceedings-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/A5014904537","display_name":"Arun K. Pujari","orcid":"https://orcid.org/0000-0003-2482-8948"},"institutions":[{"id":"https://openalex.org/I36893310","display_name":"University of Hyderabad","ror":"https://ror.org/04a7rxb17","country_code":"IN","type":"education","lineage":["https://openalex.org/I36893310"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Arun K. Pujari","raw_affiliation_strings":["University of Hyderabad, P.O. Central University, Hyderabad, India","University of Hyderabad, P.O. Central University, Hyderabad, India#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Hyderabad, P.O. Central University, Hyderabad, India","institution_ids":["https://openalex.org/I36893310"]},{"raw_affiliation_string":"University of Hyderabad, P.O. Central University, Hyderabad, India#TAB#","institution_ids":["https://openalex.org/I36893310"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078763283","display_name":"S. Mini","orcid":"https://orcid.org/0000-0002-7461-2814"},"institutions":[{"id":"https://openalex.org/I4210109276","display_name":"National Institute of Technology Goa","ror":"https://ror.org/01vmfpj79","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210109276"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"S. Mini","raw_affiliation_strings":["National Institute of Technology Goa, Goa, India","National Institute of Technology, Goa, GOA, India"],"affiliations":[{"raw_affiliation_string":"National Institute of Technology Goa, Goa, India","institution_ids":["https://openalex.org/I4210109276"]},{"raw_affiliation_string":"National Institute of Technology, Goa, GOA, India","institution_ids":["https://openalex.org/I4210109276"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019610064","display_name":"Trideba Padhi","orcid":"https://orcid.org/0000-0002-4544-5770"},"institutions":[{"id":"https://openalex.org/I4210146312","display_name":"Sambalpur University Institute of Information Technology","ror":"https://ror.org/05jnwy894","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210146312"]},{"id":"https://openalex.org/I112754052","display_name":"Sambalpur University","ror":"https://ror.org/04s222234","country_code":"IN","type":"education","lineage":["https://openalex.org/I112754052"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Trideba Padhi","raw_affiliation_strings":["Sambalpur University Institute of Information Technology, Odisha, India","Sambalpur University Institute of Information Technology, Odisha, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Sambalpur University Institute of Information Technology, Odisha, India","institution_ids":["https://openalex.org/I4210146312"]},{"raw_affiliation_string":"Sambalpur University Institute of Information Technology, Odisha, India#TAB#","institution_ids":["https://openalex.org/I112754052"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046370203","display_name":"Prabhanjan Sahoo","orcid":null},"institutions":[{"id":"https://openalex.org/I112754052","display_name":"Sambalpur University","ror":"https://ror.org/04s222234","country_code":"IN","type":"education","lineage":["https://openalex.org/I112754052"]},{"id":"https://openalex.org/I4210146312","display_name":"Sambalpur University Institute of Information Technology","ror":"https://ror.org/05jnwy894","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210146312"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Prabhanjan Sahoo","raw_affiliation_strings":["Sambalpur University Institute of Information Technology, Odisha, India","Sambalpur University Institute of Information Technology, Odisha, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Sambalpur University Institute of Information Technology, Odisha, India","institution_ids":["https://openalex.org/I4210146312"]},{"raw_affiliation_string":"Sambalpur University Institute of Information Technology, Odisha, India#TAB#","institution_ids":["https://openalex.org/I112754052"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5014904537"],"corresponding_institution_ids":["https://openalex.org/I36893310"],"apc_list":null,"apc_paid":null,"fwci":1.9969,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.879309,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9995999932289124,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9995999932289124,"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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10986","display_name":"RFID technology advancements","score":0.9750000238418579,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"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/heuristics","display_name":"Heuristics","score":0.7102612257003784},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6497517824172974},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5867931842803955},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5696843266487122},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.532677948474884},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5254786610603333},{"id":"https://openalex.org/keywords/degeneracy","display_name":"Degeneracy (biology)","score":0.5223789811134338},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5202075839042664},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5090105533599854},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4927692711353302},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.445202112197876},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.42328575253486633},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2384859323501587}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7102612257003784},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6497517824172974},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5867931842803955},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5696843266487122},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.532677948474884},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5254786610603333},{"id":"https://openalex.org/C2777727622","wikidata":"https://www.wikidata.org/wiki/Q5251772","display_name":"Degeneracy (biology)","level":2,"score":0.5223789811134338},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5202075839042664},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5090105533599854},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4927692711353302},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.445202112197876},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.42328575253486633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2384859323501587},{"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C60644358","wikidata":"https://www.wikidata.org/wiki/Q128570","display_name":"Bioinformatics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2684464.2684495","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2684464.2684495","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W140729090","https://openalex.org/W1481574876","https://openalex.org/W1524767063","https://openalex.org/W1551587226","https://openalex.org/W1895848867","https://openalex.org/W1986720140","https://openalex.org/W2001590892","https://openalex.org/W2005903960","https://openalex.org/W2008781865","https://openalex.org/W2018417185","https://openalex.org/W2031395137","https://openalex.org/W2038296134","https://openalex.org/W2058109357","https://openalex.org/W2066289752","https://openalex.org/W2076901266","https://openalex.org/W2084428425","https://openalex.org/W2086727357","https://openalex.org/W2094380852","https://openalex.org/W2106264338","https://openalex.org/W2110868814","https://openalex.org/W2133803140","https://openalex.org/W2145311081","https://openalex.org/W2157165312","https://openalex.org/W2160450532","https://openalex.org/W2169484333","https://openalex.org/W2399874162","https://openalex.org/W2493129670","https://openalex.org/W2963881646","https://openalex.org/W3175391063","https://openalex.org/W4246405741","https://openalex.org/W4254597214","https://openalex.org/W6658159510"],"related_works":["https://openalex.org/W170547082","https://openalex.org/W2136735429","https://openalex.org/W2587876411","https://openalex.org/W2358332176","https://openalex.org/W4229950834","https://openalex.org/W4301044568","https://openalex.org/W1587123803","https://openalex.org/W2128075414","https://openalex.org/W2367938014","https://openalex.org/W2201623492"],"abstract_inverted_index":{"MLTCP":[0,37,99],"(Maximum":[1],"Lifetime":[2],"Target":[3],"Coverage":[4],"Problem)":[5],"aims":[6],"at":[7],"providing":[8],"required":[9],"coverage":[10],"to":[11,27,84,98,156],"a":[12,95,110,187,193,203],"set":[13,107],"of":[14,19,43,45,52,55,57,60,104,141,163,173,175,196],"targets":[15],"maximizing":[16],"the":[17,61,90,102,130,137,143,164,180,184,215,219],"lifetime":[18],"wireless":[20],"sensor":[21],"network.":[22],"The":[23,41,119],"problem":[24,132,181],"is":[25,33,48,134,168],"known":[26],"be":[28,146],"computationally":[29],"hard":[30,46,87,114,231],"and":[31,108,126,177,225],"it":[32],"shown":[34,169],"recently":[35],"that":[36,70,112,170,214],"exhibits":[38],"phase-transition":[39],"phenomenon.":[40],"region":[42],"occurrences":[44],"instances":[47,69,115,224],"identified":[49],"in":[50],"terms":[51],"an":[53,198],"interval":[54],"values":[56],"sensing-range.":[58],"Most":[59],"earlier":[62],"heuristics":[63],"report":[64],"their":[65],"empirical":[66],"analyses":[67],"on":[68],"are":[71],"outside":[72],"this":[73],"region.":[74],"There":[75],"has":[76],"not":[77],"been":[78],"any":[79],"algorithm":[80,144,185],"proposed":[81,120,216],"so":[82],"far":[83],"handle":[85],"particularly":[86],"instances.":[88,232],"In":[89],"present":[91],"work,":[92],"we":[93],"provide":[94],"new":[96],"insight":[97],"by":[100,205],"studying":[101],"structure":[103],"polyhedral":[105],"feasible":[106,200],"propose":[109],"heuristic":[111],"distinguishes":[113],"from":[116,150,208],"solvable":[117],"cases.":[118],"method":[121,191,217],"yields":[122],"best-ever":[123,227],"near-optimal":[124,228],"solution":[125,201,221,229],"indicates":[127],"situations":[128],"when":[129],"given":[131],"instance":[133],"hard.":[135,182],"Considering":[136],"linear":[138],"programming":[139],"formulation":[140],"MLTCP,":[142],"can":[145],"viewed":[147],"as":[148],"traversal":[149],"one":[151],"BFS":[152,159,176,209],"(Basic":[153],"Feasible":[154],"Solution)":[155],"another":[157],"nonadjacent":[158],"with":[160],"non-decreasing":[161],"value":[162],"objective":[165],"function.":[166],"It":[167],"high":[171],"degree":[172],"degeneracy":[174],"cycling":[178],"make":[179],"When":[183],"encounters":[186],"non-trivial":[188],"cycle,":[189],"our":[190],"uses":[192],"novel":[194],"way":[195],"generating":[197],"improved":[199],"(not":[202],"BFS)":[204],"moving":[206],"away":[207],"search.":[210],"Experimental":[211],"results":[212],"confirm":[213],"achieves":[218],"optimal":[220],"for":[222,230],"easy":[223],"gives":[226]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}