Total positive influence domination on weighted networks
We are proposing two greedy and a new linear programming based approximation algorithm for the total positive influence dominating set problem in weighted networks. Applications of this problem in weighted settings include finding: a minimum cost set of nodes to broadcast a message in social network...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Greetham, Danica Vukadinović Charlton, Nathaniel Poghosyan, Anush |
| description | We are proposing two greedy and a new linear programming based approximation
algorithm for the total positive influence dominating set problem in weighted
networks. Applications of this problem in weighted settings include finding: a
minimum cost set of nodes to broadcast a message in social networks, such that
each node has majority of neighbours broadcasting that message; a maximum
trusted set in bitcoin network; an optimal set of hosts when running
distributed apps etc. Extensive experiments on different generated and real
networks highlight advantages and potential issues for each algorithm. |
| doi_str_mv | 10.48550/arxiv.1604.07661 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1604_07661</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1604_07661</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-3f604b926a75c1cc6c21e6c868b813162e2b8a662b905401dc491f1397f638153</originalsourceid><addsrcrecordid>eNotj8tOwzAURL1hgQofwAr_QIKvHd84S1RRQKrEJvvIca6p1dSuEtPH37cUpJFmN2cOY08gyspoLV7sdAqHElBUpagR4Z6ZNmU78n2aQw4H4iH68YeiIz6kXYg2hxT5NUcK35tMA4-Uj2nazg_szttxpsf_XrB29dYuP4r11_vn8nVdWKyhUP7K6huJttYOnEMngdAZNL0BBShJ9sYiyr4RuhIwuKoBD6qpPSoDWi3Y89_s7Xq3n8LOTufuV6G7KagL0VhAag</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Total positive influence domination on weighted networks</title><source>arXiv.org</source><creator>Greetham, Danica Vukadinović ; Charlton, Nathaniel ; Poghosyan, Anush</creator><creatorcontrib>Greetham, Danica Vukadinović ; Charlton, Nathaniel ; Poghosyan, Anush</creatorcontrib><description>We are proposing two greedy and a new linear programming based approximation
algorithm for the total positive influence dominating set problem in weighted
networks. Applications of this problem in weighted settings include finding: a
minimum cost set of nodes to broadcast a message in social networks, such that
each node has majority of neighbours broadcasting that message; a maximum
trusted set in bitcoin network; an optimal set of hosts when running
distributed apps etc. Extensive experiments on different generated and real
networks highlight advantages and potential issues for each algorithm.</description><identifier>DOI: 10.48550/arxiv.1604.07661</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms ; Computer Science - Discrete Mathematics ; Mathematics - Optimization and Control</subject><creationdate>2016-04</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1604.07661$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1604.07661$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Greetham, Danica Vukadinović</creatorcontrib><creatorcontrib>Charlton, Nathaniel</creatorcontrib><creatorcontrib>Poghosyan, Anush</creatorcontrib><title>Total positive influence domination on weighted networks</title><description>We are proposing two greedy and a new linear programming based approximation
algorithm for the total positive influence dominating set problem in weighted
networks. Applications of this problem in weighted settings include finding: a
minimum cost set of nodes to broadcast a message in social networks, such that
each node has majority of neighbours broadcasting that message; a maximum
trusted set in bitcoin network; an optimal set of hosts when running
distributed apps etc. Extensive experiments on different generated and real
networks highlight advantages and potential issues for each algorithm.</description><subject>Computer Science - Data Structures and Algorithms</subject><subject>Computer Science - Discrete Mathematics</subject><subject>Mathematics - Optimization and Control</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tOwzAURL1hgQofwAr_QIKvHd84S1RRQKrEJvvIca6p1dSuEtPH37cUpJFmN2cOY08gyspoLV7sdAqHElBUpagR4Z6ZNmU78n2aQw4H4iH68YeiIz6kXYg2hxT5NUcK35tMA4-Uj2nazg_szttxpsf_XrB29dYuP4r11_vn8nVdWKyhUP7K6huJttYOnEMngdAZNL0BBShJ9sYiyr4RuhIwuKoBD6qpPSoDWi3Y89_s7Xq3n8LOTufuV6G7KagL0VhAag</recordid><startdate>20160426</startdate><enddate>20160426</enddate><creator>Greetham, Danica Vukadinović</creator><creator>Charlton, Nathaniel</creator><creator>Poghosyan, Anush</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20160426</creationdate><title>Total positive influence domination on weighted networks</title><author>Greetham, Danica Vukadinović ; Charlton, Nathaniel ; Poghosyan, Anush</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-3f604b926a75c1cc6c21e6c868b813162e2b8a662b905401dc491f1397f638153</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><topic>Computer Science - Discrete Mathematics</topic><topic>Mathematics - Optimization and Control</topic><toplevel>online_resources</toplevel><creatorcontrib>Greetham, Danica Vukadinović</creatorcontrib><creatorcontrib>Charlton, Nathaniel</creatorcontrib><creatorcontrib>Poghosyan, Anush</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Greetham, Danica Vukadinović</au><au>Charlton, Nathaniel</au><au>Poghosyan, Anush</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Total positive influence domination on weighted networks</atitle><date>2016-04-26</date><risdate>2016</risdate><abstract>We are proposing two greedy and a new linear programming based approximation
algorithm for the total positive influence dominating set problem in weighted
networks. Applications of this problem in weighted settings include finding: a
minimum cost set of nodes to broadcast a message in social networks, such that
each node has majority of neighbours broadcasting that message; a maximum
trusted set in bitcoin network; an optimal set of hosts when running
distributed apps etc. Extensive experiments on different generated and real
networks highlight advantages and potential issues for each algorithm.</abstract><doi>10.48550/arxiv.1604.07661</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1604.07661 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1604_07661 |
| source | arXiv.org |
| subjects | Computer Science - Data Structures and Algorithms Computer Science - Discrete Mathematics Mathematics - Optimization and Control |
| title | Total positive influence domination on weighted networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T08%3A24%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Total%20positive%20influence%20domination%20on%20weighted%20networks&rft.au=Greetham,%20Danica%20Vukadinovi%C4%87&rft.date=2016-04-26&rft_id=info:doi/10.48550/arxiv.1604.07661&rft_dat=%3Carxiv_GOX%3E1604_07661%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |