{"id":"https://openalex.org/W2038405834","doi":"https://doi.org/10.1109/icde.2014.6816696","title":"Random-walk domination in large graphs","display_name":"Random-walk domination in large graphs","publication_year":2014,"publication_date":"2014-03-01","ids":{"openalex":"https://openalex.org/W2038405834","doi":"https://doi.org/10.1109/icde.2014.6816696","mag":"2038405834"},"language":"en","primary_location":{"id":"doi:10.1109/icde.2014.6816696","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2014.6816696","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 30th International Conference on Data Engineering","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/A5100742464","display_name":"Rong-Hua Li","orcid":"https://orcid.org/0009-0003-1153-8906"},"institutions":[{"id":"https://openalex.org/I180726961","display_name":"Shenzhen University","ror":"https://ror.org/01vy4gh70","country_code":"CN","type":"education","lineage":["https://openalex.org/I180726961"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Rong-Hua Li","raw_affiliation_strings":["Guangdong Province Key Laboratory of Popular High Performance Computers, Shenzhen University, China","Guangdong Province Key Laboratory of Popular High Performance Computers, Shenzhen University, China#TAB#"],"affiliations":[{"raw_affiliation_string":"Guangdong Province Key Laboratory of Popular High Performance Computers, Shenzhen University, China","institution_ids":["https://openalex.org/I180726961"]},{"raw_affiliation_string":"Guangdong Province Key Laboratory of Popular High Performance Computers, Shenzhen University, China#TAB#","institution_ids":["https://openalex.org/I180726961"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075642293","display_name":"Jeffrey Xu Yu","orcid":"https://orcid.org/0000-0002-9738-827X"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jeffrey Xu Yu","raw_affiliation_strings":["The Chinese University of Hong Kong","The Chinese University of Hong Kong, China#TAB#"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":"The Chinese University of Hong Kong, China#TAB#","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103032917","display_name":"Xin Huang","orcid":"https://orcid.org/0000-0001-9674-1994"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xin Huang","raw_affiliation_strings":["The Chinese University of Hong Kong","The Chinese University of Hong Kong, China#TAB#"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":"The Chinese University of Hong Kong, China#TAB#","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101984697","display_name":"Hong Cheng","orcid":"https://orcid.org/0000-0002-4673-2587"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hong Cheng","raw_affiliation_strings":["The Chinese University of Hong Kong","The Chinese University of Hong Kong, China#TAB#"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":"The Chinese University of Hong Kong, China#TAB#","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100742464"],"corresponding_institution_ids":["https://openalex.org/I180726961"],"apc_list":null,"apc_paid":null,"fwci":4.0213,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.93866693,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"736","last_page":"747"},"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.9998999834060669,"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.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.996999979019165,"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.9965999722480774,"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.6771611571311951},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.6471334099769592},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.613725483417511},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5618184804916382},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5517551302909851},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5464110374450684},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5322672724723816},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4902382493019104},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.47282254695892334},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4658815264701843},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4289637506008148},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38074791431427},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34430673718452454},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32075148820877075}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.6771611571311951},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.6471334099769592},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.613725483417511},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5618184804916382},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5517551302909851},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5464110374450684},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5322672724723816},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4902382493019104},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.47282254695892334},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4658815264701843},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4289637506008148},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38074791431427},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34430673718452454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32075148820877075},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icde.2014.6816696","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2014.6816696","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 30th International Conference on Data Engineering","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.702.8381","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.702.8381","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www1.se.cuhk.edu.hk/%7Erhli/paper/rwdom.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6200000047683716,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W244636295","https://openalex.org/W1493071618","https://openalex.org/W1547213408","https://openalex.org/W1581552469","https://openalex.org/W1604865916","https://openalex.org/W1609329376","https://openalex.org/W1680189815","https://openalex.org/W1963841648","https://openalex.org/W1972714715","https://openalex.org/W2008620264","https://openalex.org/W2019465190","https://openalex.org/W2061820396","https://openalex.org/W2101979578","https://openalex.org/W2103012681","https://openalex.org/W2105241801","https://openalex.org/W2122683728","https://openalex.org/W2127622665","https://openalex.org/W2129588702","https://openalex.org/W2130325103","https://openalex.org/W2131824593","https://openalex.org/W2134003300","https://openalex.org/W2141403143","https://openalex.org/W2143996311","https://openalex.org/W2144933361","https://openalex.org/W2147982124","https://openalex.org/W2156184725","https://openalex.org/W2165275875","https://openalex.org/W2402962589","https://openalex.org/W2963165998","https://openalex.org/W2963927785","https://openalex.org/W3003506411","https://openalex.org/W3118655244","https://openalex.org/W3141863997","https://openalex.org/W4233413206","https://openalex.org/W6609250658","https://openalex.org/W6637667603","https://openalex.org/W6640946039","https://openalex.org/W6675407067","https://openalex.org/W6679608865","https://openalex.org/W6681106510","https://openalex.org/W6681692254"],"related_works":["https://openalex.org/W2402949237","https://openalex.org/W2594118609","https://openalex.org/W2950365512","https://openalex.org/W2765425000","https://openalex.org/W2735578456","https://openalex.org/W1608444752","https://openalex.org/W4389478405","https://openalex.org/W2944632132","https://openalex.org/W2963059222","https://openalex.org/W3204684126"],"abstract_inverted_index":{"We":[0,110],"introduce":[1],"and":[2,32,183,201,210],"formulate":[3],"two":[4,116],"types":[5],"of":[6,16,45,49,64,83,97,119,212],"random-walk":[7,50,84],"domination":[8,51,85],"problems":[9,114],"in":[10,18,23,29,35],"graphs":[11],"motivated":[12],"by":[13],"a":[14,40,135],"number":[15,96],"applications":[17],"practice":[19],"(e.g.,":[20],"item-placement":[21],"problem":[22,28,34,52,86],"online":[24],"social":[25],"networks,":[26,31],"Ads-placement":[27],"advertisement":[30],"resource-placement":[33],"P2P":[36],"networks).":[37],"Specifically,":[38],"given":[39],"graph":[41,181],"G,":[42],"the":[43,46,60,71,75,94,120,158,167,180,207,213],"goal":[44],"first":[47],"type":[48,82],"is":[53,78,87,142,152,193],"to":[54,74,88,92,157],"target":[55],"k":[56,90],"nodes":[57,73,77,91,98],"such":[58],"that":[59,99,112],"total":[61],"hitting":[62],"time":[63,177],"an":[65,106,171],"L-length":[66,107],"random":[67,108,198],"walk":[68,199],"starting":[69],"from":[70],"remaining":[72],"targeted":[76,103],"minimized.":[79],"The":[80,147,189],"second":[81],"find":[89],"maximize":[93],"expected":[95],"hit":[100],"any":[101],"one":[102],"node":[104],"through":[105],"walk.":[109],"prove":[111],"these":[113],"are":[115],"special":[117],"instances":[118],"submodular":[121],"set":[122],"function":[123],"maximization":[124],"with":[125,143,175,185],"cardinality":[126],"constraint":[127],"problem.":[128],"To":[129,163],"solve":[130],"them":[131],"effectively,":[132],"we":[133,169],"propose":[134,170],"dynamic-programming":[136],"(DP)":[137],"based":[138,194],"greedy":[139,149,173,191],"algorithm":[140,174,192],"which":[141],"near-optimal":[144,186],"performance":[145,187],"guarantee.":[146,188],"DP-based":[148],"algorithm,":[150,168],"however,":[151],"not":[153],"very":[154],"efficient":[155],"due":[156],"expensive":[159],"marginal":[160],"gain":[161],"evaluation.":[162],"further":[164],"speed":[165],"up":[166],"approximate":[172,190],"linear":[176],"complexity":[178],"w.r.t.":[179],"size":[182],"also":[184],"on":[195],"carefully":[196],"designed":[197],"sampling":[200],"sample-materialization":[202],"techniques.":[203],"Extensive":[204],"experiments":[205],"demonstrate":[206],"effectiveness,":[208],"efficiency":[209],"scalability":[211],"proposed":[214],"algorithms.":[215]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}