{"id":"https://openalex.org/W2059941319","doi":"https://doi.org/10.1145/1978782.1978794","title":"Improved approximations for the hotlink assignment problem","display_name":"Improved approximations for the hotlink assignment problem","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2059941319","doi":"https://doi.org/10.1145/1978782.1978794","mag":"2059941319"},"language":"en","primary_location":{"id":"doi:10.1145/1978782.1978794","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1978782.1978794","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5073527139","display_name":"Eduardo Sany Laber","orcid":"https://orcid.org/0000-0002-9025-8333"},"institutions":[{"id":"https://openalex.org/I2699952","display_name":"Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro","ror":"https://ror.org/01dg47b60","country_code":"BR","type":"education","lineage":["https://openalex.org/I2699952"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Eduardo Laber","raw_affiliation_strings":["PUC-Rio, Gavea-Rio de Janeiro, RJ-Brasil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PUC-Rio, Gavea-Rio de Janeiro, RJ-Brasil","institution_ids":["https://openalex.org/I2699952"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091196390","display_name":"Marco Molinaro","orcid":"https://orcid.org/0000-0003-0174-3204"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marco Molinaro","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA","Carnegie-Mellon University, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6381,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.69751642,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":"3","first_page":"1","last_page":"34"},"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.9993000030517578,"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.9993000030517578,"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.9990000128746033,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9908999800682068,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6049004793167114},{"id":"https://openalex.org/keywords/hyperlink","display_name":"Hyperlink","score":0.5946953892707825},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5613037943840027},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5581616759300232},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5409016013145447},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5401583909988403},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5362007021903992},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48746562004089355},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4867822825908661},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47918665409088135},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46660158038139343},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.46397432684898376},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37000328302383423},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33621037006378174},{"id":"https://openalex.org/keywords/web-page","display_name":"Web page","score":0.27505651116371155}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6049004793167114},{"id":"https://openalex.org/C30088001","wikidata":"https://www.wikidata.org/wiki/Q102014","display_name":"Hyperlink","level":3,"score":0.5946953892707825},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5613037943840027},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5581616759300232},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5409016013145447},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5401583909988403},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5362007021903992},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48746562004089355},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4867822825908661},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47918665409088135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46660158038139343},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.46397432684898376},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37000328302383423},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33621037006378174},{"id":"https://openalex.org/C21959979","wikidata":"https://www.wikidata.org/wiki/Q36774","display_name":"Web page","level":2,"score":0.27505651116371155},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","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":1,"locations":[{"id":"doi:10.1145/1978782.1978794","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1978782.1978794","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G682424003","display_name":null,"funder_award_id":"304786/2006-3470654/2007-4","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G687698851","display_name":null,"funder_award_id":"E-26/100.505/2007","funder_id":"https://openalex.org/F4320322749","funder_display_name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro"}],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"},{"id":"https://openalex.org/F4320322749","display_name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","ror":"https://ror.org/03kk0s825"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W119697654","https://openalex.org/W131076514","https://openalex.org/W157866064","https://openalex.org/W1504007973","https://openalex.org/W1574759554","https://openalex.org/W1789399906","https://openalex.org/W1954834875","https://openalex.org/W1974704934","https://openalex.org/W2064746497","https://openalex.org/W2066209652","https://openalex.org/W2133779208","https://openalex.org/W2137091452","https://openalex.org/W2139005256","https://openalex.org/W2142901448","https://openalex.org/W2151960262","https://openalex.org/W2161378143","https://openalex.org/W2174565446","https://openalex.org/W2178078103","https://openalex.org/W2293305679","https://openalex.org/W2914715123","https://openalex.org/W4205855417"],"related_works":["https://openalex.org/W2384033143","https://openalex.org/W1525584714","https://openalex.org/W2366569016","https://openalex.org/W2169968158","https://openalex.org/W1999760390","https://openalex.org/W2086877241","https://openalex.org/W2765600275","https://openalex.org/W4300501056","https://openalex.org/W2392246501","https://openalex.org/W2031552172"],"abstract_inverted_index":{"Let":[0],"G":[1,36,59],"=(":[2],"V,E":[3],")":[4],"be":[5,99,206,228],"a":[6,9,61,141,151,189],"graph":[7],"representing":[8],"Web":[10,33],"site,":[11],"where":[12,58,93,200],"nodes":[13],"correspond":[14],"to":[15,19,32,39,46,82,101,202,227],"pages":[16,34],"and":[17,65,126,149,224],"arcs":[18],"hyperlinks.":[20],"In":[21,51],"this":[22,52,91,236],"context,":[23],"hotlinks":[24,81,204],"are":[25,166],"defined":[26],"as":[27],"shortcuts":[28],"(new":[29],"arcs)":[30],"added":[31,100],"of":[35,90,108,197],"in":[37,116,133,160,214],"order":[38],"reduce":[40],"the":[41,56,66,70,86,106,117,121,127,130,146,154,168,176,193,198,229],"time":[42,72,223],"spent":[43,73],"by":[44,74,76],"users":[45,75],"reach":[47],"their":[48],"desired":[49],"information.":[50],"article,":[53],"we":[54,104,185],"consider":[55],"problem":[57,92,199],"is":[60,68,188],"rooted":[62],"directed":[63],"tree":[64],"goal":[67],"minimizing":[69],"expected":[71,122,131,147,155],"assigning":[77],"at":[78,94],"most":[79,87,95,194],"k":[80,203],"each":[83,102,209],"node.":[84,210],"For":[85],"studied":[88],"version":[89,196],"one":[96,119,172],"hotlink":[97],"can":[98,173,205],"node,":[103],"prove":[105],"existence":[107],"two":[109],"FPTAS's":[110,165],"which":[111],"optimize":[112],"different":[113],"objectives":[114],"considered":[115],"literature:":[118],"minimizes":[120],"user":[123,134],"path":[124,135],"length":[125,148],"other":[128],"maximizes":[129],"reduction":[132],"lengths.":[136],"These":[137],"results":[138,171],"improve":[139],"over":[140,150],"constant":[142,233],"factor":[143],"approximation":[144,234],"for":[145,153,192,235],"PTAS":[152],"reduction,":[156],"both":[157],"obtained":[158],"recently":[159],"Jacobs":[161],"[2007].":[162],"Indeed,":[163],"these":[164],"essentially":[167],"best":[169],"possible":[170],"achieve":[174],"under":[175],"assumption":[177],"that":[178],"P":[179],"\u2260":[180],"NP":[181],".":[182],"Another":[183],"contribution":[184],"give":[186],"here":[187],"16-approximation":[190],"algorithm":[191,212,231],"general":[195],"up":[201],"assigned":[207],"from":[208],"This":[211],"runs":[213],"O":[215],"(|":[216],"V":[217,221],"|":[218,220],"log":[219],"|)":[222],"it":[225],"turns":[226],"first":[230],"with":[232],"problem.":[237]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}