The Densest $k$-Subhypergraph Problem
Gespeichert in:
| Veröffentlicht in: | SIAM journal on discrete mathematics 2018-01, Vol.32 (2), p.1458-1477 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1477 |
|---|---|
| container_issue | 2 |
| container_start_page | 1458 |
| container_title | SIAM journal on discrete mathematics |
| container_volume | 32 |
| creator | Chlamtáč, Eden Dinitz, Michael Konrad, Christian Kortsarz, Guy Rabanca, George |
| description | |
| doi_str_mv | 10.1137/16M1096402 |
| format | Article |
| fullrecord | <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1137_16M1096402</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1137_16M1096402</sourcerecordid><originalsourceid>FETCH-LOGICAL-c267t-946521e6c45e48da96f1068097b8a19d1396a614f88f3ac41b43f237304ee1623</originalsourceid><addsrcrecordid>eNpFj01LAzEQQIMouFYv_oI91IuwOpPMTpKj1PoBFQXrecluJ67a2iWph_57Kwqe3js9eEqdIlwgGnuJ_IDgmUDvqWJndWWReF8V4HZODvBQHeX8DoBEWBfqbN5LeS2fWfKmHH-Mq-evtt8Okl5TGPryKa3bpayO1UEMyywnfxypl5vpfHJXzR5v7ydXs6rTbDeVJ641CndUC7lF8BwR2IG3rQvoF2g8B0aKzkUTOsKWTNTGGiARZG1G6vy326V1zkliM6S3VUjbBqH5GWz-B8033cA_lA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>The Densest $k$-Subhypergraph Problem</title><source>LOCUS - SIAM's Online Journal Archive</source><creator>Chlamtáč, Eden ; Dinitz, Michael ; Konrad, Christian ; Kortsarz, Guy ; Rabanca, George</creator><creatorcontrib>Chlamtáč, Eden ; Dinitz, Michael ; Konrad, Christian ; Kortsarz, Guy ; Rabanca, George</creatorcontrib><identifier>ISSN: 0895-4801</identifier><identifier>EISSN: 1095-7146</identifier><identifier>DOI: 10.1137/16M1096402</identifier><language>eng</language><ispartof>SIAM journal on discrete mathematics, 2018-01, Vol.32 (2), p.1458-1477</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c267t-946521e6c45e48da96f1068097b8a19d1396a614f88f3ac41b43f237304ee1623</citedby><cites>FETCH-LOGICAL-c267t-946521e6c45e48da96f1068097b8a19d1396a614f88f3ac41b43f237304ee1623</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,777,781,3172,27905,27906</link.rule.ids></links><search><creatorcontrib>Chlamtáč, Eden</creatorcontrib><creatorcontrib>Dinitz, Michael</creatorcontrib><creatorcontrib>Konrad, Christian</creatorcontrib><creatorcontrib>Kortsarz, Guy</creatorcontrib><creatorcontrib>Rabanca, George</creatorcontrib><title>The Densest $k$-Subhypergraph Problem</title><title>SIAM journal on discrete mathematics</title><issn>0895-4801</issn><issn>1095-7146</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNpFj01LAzEQQIMouFYv_oI91IuwOpPMTpKj1PoBFQXrecluJ67a2iWph_57Kwqe3js9eEqdIlwgGnuJ_IDgmUDvqWJndWWReF8V4HZODvBQHeX8DoBEWBfqbN5LeS2fWfKmHH-Mq-evtt8Okl5TGPryKa3bpayO1UEMyywnfxypl5vpfHJXzR5v7ydXs6rTbDeVJ641CndUC7lF8BwR2IG3rQvoF2g8B0aKzkUTOsKWTNTGGiARZG1G6vy326V1zkliM6S3VUjbBqH5GWz-B8033cA_lA</recordid><startdate>201801</startdate><enddate>201801</enddate><creator>Chlamtáč, Eden</creator><creator>Dinitz, Michael</creator><creator>Konrad, Christian</creator><creator>Kortsarz, Guy</creator><creator>Rabanca, George</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>201801</creationdate><title>The Densest $k$-Subhypergraph Problem</title><author>Chlamtáč, Eden ; Dinitz, Michael ; Konrad, Christian ; Kortsarz, Guy ; Rabanca, George</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c267t-946521e6c45e48da96f1068097b8a19d1396a614f88f3ac41b43f237304ee1623</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chlamtáč, Eden</creatorcontrib><creatorcontrib>Dinitz, Michael</creatorcontrib><creatorcontrib>Konrad, Christian</creatorcontrib><creatorcontrib>Kortsarz, Guy</creatorcontrib><creatorcontrib>Rabanca, George</creatorcontrib><collection>CrossRef</collection><jtitle>SIAM journal on discrete mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chlamtáč, Eden</au><au>Dinitz, Michael</au><au>Konrad, Christian</au><au>Kortsarz, Guy</au><au>Rabanca, George</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Densest $k$-Subhypergraph Problem</atitle><jtitle>SIAM journal on discrete mathematics</jtitle><date>2018-01</date><risdate>2018</risdate><volume>32</volume><issue>2</issue><spage>1458</spage><epage>1477</epage><pages>1458-1477</pages><issn>0895-4801</issn><eissn>1095-7146</eissn><doi>10.1137/16M1096402</doi><tpages>20</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0895-4801 |
| ispartof | SIAM journal on discrete mathematics, 2018-01, Vol.32 (2), p.1458-1477 |
| issn | 0895-4801 1095-7146 |
| language | eng |
| recordid | cdi_crossref_primary_10_1137_16M1096402 |
| source | LOCUS - SIAM's Online Journal Archive |
| title | The Densest $k$-Subhypergraph Problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T04%3A45%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20Densest%20$k$-Subhypergraph%20Problem&rft.jtitle=SIAM%20journal%20on%20discrete%20mathematics&rft.au=Chlamt%C3%A1%C4%8D,%20Eden&rft.date=2018-01&rft.volume=32&rft.issue=2&rft.spage=1458&rft.epage=1477&rft.pages=1458-1477&rft.issn=0895-4801&rft.eissn=1095-7146&rft_id=info:doi/10.1137/16M1096402&rft_dat=%3Ccrossref%3E10_1137_16M1096402%3C/crossref%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 |