Online maximum kk-coverage
We study an online model for the maximum kk-vertex-coverage problem, in which, given a graph G=(V,E)G=(V,E) and an integer kk, we seek a subset A[subE]VA[subE]V such that
Gespeichert in:
| Veröffentlicht in: | Discrete Applied Mathematics 2012-09, Vol.160 (13-14), p.1901-1913 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1913 |
|---|---|
| container_issue | 13-14 |
| container_start_page | 1901 |
| container_title | Discrete Applied Mathematics |
| container_volume | 160 |
| creator | Ausiello, G Boria, N Giannakos, A Lucarelli, G Paschos, VTh |
| description | We study an online model for the maximum kk-vertex-coverage problem, in which, given a graph G=(V,E)G=(V,E) and an integer kk, we seek a subset A[subE]VA[subE]V such that |
| doi_str_mv | 10.1016/j.dam.2012.04.005 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_1567073462</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1567073462</sourcerecordid><originalsourceid>FETCH-proquest_miscellaneous_15670734623</originalsourceid><addsrcrecordid>eNpjYJA0NNAzNDA008_SS0nM1TMyMDTSMzDRMzAwZWHgBIqb6RoZWkRwMHAVF2cZAIGhhRkng5R_Xk5mXqpCbmJFZm5prkJ2tm5yfllqUWJ6Kg8Da1piTnEqL5TmZtBwcw1x9tAtKMovLE0tLonPzSxOTs3JScxLzS8tjjc0NTM3MDc2MTMyJkEpAC_5NDE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1567073462</pqid></control><display><type>article</type><title>Online maximum kk-coverage</title><source>Elsevier ScienceDirect Journals</source><source>EZB Electronic Journals Library</source><creator>Ausiello, G ; Boria, N ; Giannakos, A ; Lucarelli, G ; Paschos, VTh</creator><creatorcontrib>Ausiello, G ; Boria, N ; Giannakos, A ; Lucarelli, G ; Paschos, VTh</creatorcontrib><description>We study an online model for the maximum kk-vertex-coverage problem, in which, given a graph G=(V,E)G=(V,E) and an integer kk, we seek a subset A[subE]VA[subE]V such that</description><identifier>ISSN: 0166-218X</identifier><identifier>DOI: 10.1016/j.dam.2012.04.005</identifier><language>eng</language><subject>Graphs ; Integers ; Mathematical models ; Online</subject><ispartof>Discrete Applied Mathematics, 2012-09, Vol.160 (13-14), p.1901-1913</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,777,781,27905,27906</link.rule.ids></links><search><creatorcontrib>Ausiello, G</creatorcontrib><creatorcontrib>Boria, N</creatorcontrib><creatorcontrib>Giannakos, A</creatorcontrib><creatorcontrib>Lucarelli, G</creatorcontrib><creatorcontrib>Paschos, VTh</creatorcontrib><title>Online maximum kk-coverage</title><title>Discrete Applied Mathematics</title><description>We study an online model for the maximum kk-vertex-coverage problem, in which, given a graph G=(V,E)G=(V,E) and an integer kk, we seek a subset A[subE]VA[subE]V such that</description><subject>Graphs</subject><subject>Integers</subject><subject>Mathematical models</subject><subject>Online</subject><issn>0166-218X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNpjYJA0NNAzNDA008_SS0nM1TMyMDTSMzDRMzAwZWHgBIqb6RoZWkRwMHAVF2cZAIGhhRkng5R_Xk5mXqpCbmJFZm5prkJ2tm5yfllqUWJ6Kg8Da1piTnEqL5TmZtBwcw1x9tAtKMovLE0tLonPzSxOTs3JScxLzS8tjjc0NTM3MDc2MTMyJkEpAC_5NDE</recordid><startdate>20120901</startdate><enddate>20120901</enddate><creator>Ausiello, G</creator><creator>Boria, N</creator><creator>Giannakos, A</creator><creator>Lucarelli, G</creator><creator>Paschos, VTh</creator><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20120901</creationdate><title>Online maximum kk-coverage</title><author>Ausiello, G ; Boria, N ; Giannakos, A ; Lucarelli, G ; Paschos, VTh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_miscellaneous_15670734623</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Graphs</topic><topic>Integers</topic><topic>Mathematical models</topic><topic>Online</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ausiello, G</creatorcontrib><creatorcontrib>Boria, N</creatorcontrib><creatorcontrib>Giannakos, A</creatorcontrib><creatorcontrib>Lucarelli, G</creatorcontrib><creatorcontrib>Paschos, VTh</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Discrete Applied Mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ausiello, G</au><au>Boria, N</au><au>Giannakos, A</au><au>Lucarelli, G</au><au>Paschos, VTh</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Online maximum kk-coverage</atitle><jtitle>Discrete Applied Mathematics</jtitle><date>2012-09-01</date><risdate>2012</risdate><volume>160</volume><issue>13-14</issue><spage>1901</spage><epage>1913</epage><pages>1901-1913</pages><issn>0166-218X</issn><abstract>We study an online model for the maximum kk-vertex-coverage problem, in which, given a graph G=(V,E)G=(V,E) and an integer kk, we seek a subset A[subE]VA[subE]V such that</abstract><doi>10.1016/j.dam.2012.04.005</doi></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0166-218X |
| ispartof | Discrete Applied Mathematics, 2012-09, Vol.160 (13-14), p.1901-1913 |
| issn | 0166-218X |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1567073462 |
| source | Elsevier ScienceDirect Journals; EZB Electronic Journals Library |
| subjects | Graphs Integers Mathematical models Online |
| title | Online maximum kk-coverage |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T17%3A56%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Online%20maximum%20kk-coverage&rft.jtitle=Discrete%20Applied%20Mathematics&rft.au=Ausiello,%20G&rft.date=2012-09-01&rft.volume=160&rft.issue=13-14&rft.spage=1901&rft.epage=1913&rft.pages=1901-1913&rft.issn=0166-218X&rft_id=info:doi/10.1016/j.dam.2012.04.005&rft_dat=%3Cproquest%3E1567073462%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1567073462&rft_id=info:pmid/&rfr_iscdi=true |