Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21):
The SIAM Conference on Applied and Computational Discrete Algorithms is a new conference that brings together researchers who design and study combinatorial and graph algorithms motivated by applications. ACDA is organized by SIAM under the auspices of the SIAM Activity Group on Applied and Computat...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Körperschaft: | |
| Weitere Verfasser: | , , |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Philadelphia, Pennsylvania
Society for Industrial and Applied Mathematics, SIAM
[2021]
|
| Schlagworte: | |
| Online-Zugang: | TUM01 UBW01 UBY01 UER01 URL des Erstveröffentlichers |
| Zusammenfassung: | The SIAM Conference on Applied and Computational Discrete Algorithms is a new conference that brings together researchers who design and study combinatorial and graph algorithms motivated by applications. ACDA is organized by SIAM under the auspices of the SIAM Activity Group on Applied and Computational Discrete Algorithms. ACDA subsumes the long-running series of SIAM Workshops on Combinatorial Scientific Computing, and expands its scope to applications of discrete models and algorithms across all areas in the physical and life sciences and engineering, the social and information sciences, and anywhere discrete mathematical techniques are used to formulate and solve problems in the world. ACDA invites papers on the formulation of combinatorial problems from applications; theoretical analyses; design of algorithms; computational evaluation of the algorithms; and deployment of the resulting software to enable applications |
| Beschreibung: | 1 Online-Ressource (239 Seiten) Illustrationen |
| ISBN: | 9781611976830 1611976839 |
| DOI: | 10.1137/1.9781611976830 |
Internformat
MARC
| LEADER | 00000nmm a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV047425836 | ||
| 003 | DE-604 | ||
| 005 | 20221017 | ||
| 006 | a |||| 10||| | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 210818s2021 |||| o||u| ||||||eng d | ||
| 020 | |a 9781611976830 |9 978-1-61197-683-0 | ||
| 020 | |a 1611976839 |9 1611976839 | ||
| 024 | 7 | |a 10.1137/1.9781611976830 |2 doi | |
| 028 | 5 | 2 | |a ACDA21 |
| 035 | |a (ZDB-72-SIA)978-1-61197-683-0 | ||
| 035 | |a (OCoLC)1268188445 | ||
| 035 | |a (DE-599)BVBBV047425836 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 |a DE-20 |a DE-29 |a DE-706 |a DE-91 | ||
| 110 | 2 | |a SIAM Conference on Applied and Computational Discrete Algorithms |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21) |c editors Michael Bender ; John Gilbert ; Bruce Hendrickson ; Blair D. Sullivan |
| 246 | 1 | 3 | |a SIAM 2021 Conference on Applied & Computational Discrete Algorithms |
| 264 | 1 | |a Philadelphia, Pennsylvania |b Society for Industrial and Applied Mathematics, SIAM |c [2021] | |
| 300 | |a 1 Online-Ressource (239 Seiten) |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 505 | 8 | |a Queues with small advice / Michael Mitzenmacher -- The quantile matching problem and point cloud registration / Stéphane Chrétien, Oya Ekin Karaşan, Ecenur Oguz, and Mustafa Ç. Pınar -- Using predicted weights for ad delivery / Thomas Lavastida, Benjamin Moseley, R. Ravi, and Chenyang Xu -- Fully-dynamic weighted matching approximation in practice / Eugenio Angriman, Henning Meyerhenke, Christian Schulz, and Bora Uçar -- A parallel approximation algorithm for maximizing submodular b-matching / S.M Ferdous, Alex Pothen, Arif Khan, Ajay Panyala, and Mahantesh Halappanavar -- Non-monotone adaptive submodular meta-learning / Shaojie Tang and Jing Yuan -- Improving tug-of-war sketch using control-variates method / Rameshwar Pratap, Bhisham Dev Verma, and Raghav Kulkarni -- On the difference between search space size and query complexity in contraction hierarchies / Claudius Proissl and Tobias Rupp -- | |
| 505 | 8 | |a Fairmandering : a column generation heuristic for fairness-optimized political districting / Wes Gurnee and David B. Shmoys -- Faster parallel multiterminal cuts / Monika Henzinger, Alexander Noe, and Christian Schulz -- Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition / Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, and Blair D. Sullivan -- BELLA: Berkeley efficient long-read to long-read aligner and overlapper / Giulia Guidi, Marquita Ellis, Daniel Rokhsar, Katherine Yelick, and Aydın Buluç -- Parallel clique counting and peeling algorithms / Jessica Shi, Laxman Dhulipala, and Julian Shun -- A message-driven, multi-GPU parallel sparse triangular solver / Nan Ding, Yang Liu, Samuel Williams, and Xiaoye S. Li -- A dynamic program for computing the joint cumulative distribution function of order statistics / Rigel Galgana, Cengke Shi, Amy Greenwald, and Takehiro Oyakawa -- | |
| 505 | 8 | |a Efficient signed backward substitution for piecewise affine functions via path problems in a directed acyclic graph / Torsten Bosse, Ralf Seidler, and H. Martin Bücker -- Multidimensional included and excluded sums / Helen Xu, Sean Fraser, and Charles E. Leiserson -- Efficient parallel sparse symmetric tucker decomposition for high-order tensors / Shruti Shivakumar, Jiajia Li, Ramakrishnan Kannan, and Srinivas Aluru -- The traveling firefighter problem / Majid Farhadi, Alejandro Toriello, and Prasad Tetali -- Search and evacuation with a near majority of faulty agents / Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, and Grzegorz Stachowiak -- On the request-trip-vehicle assignment problem / J. Carlos Martínez Mori and Samitha Samaranayake | |
| 520 | 3 | |a The SIAM Conference on Applied and Computational Discrete Algorithms is a new conference that brings together researchers who design and study combinatorial and graph algorithms motivated by applications. ACDA is organized by SIAM under the auspices of the SIAM Activity Group on Applied and Computational Discrete Algorithms. ACDA subsumes the long-running series of SIAM Workshops on Combinatorial Scientific Computing, and expands its scope to applications of discrete models and algorithms across all areas in the physical and life sciences and engineering, the social and information sciences, and anywhere discrete mathematical techniques are used to formulate and solve problems in the world. ACDA invites papers on the formulation of combinatorial problems from applications; theoretical analyses; design of algorithms; computational evaluation of the algorithms; and deployment of the resulting software to enable applications | |
| 653 | 0 | |a Combinatorial analysis / Congresses | |
| 653 | 0 | |a Graph algorithms / Congresses | |
| 653 | 0 | |a Algorithms / Congresses | |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 700 | 1 | |a Bender, Michael |4 edt | |
| 700 | 1 | |a Gilbert, John |4 edt | |
| 700 | 1 | |a Hendrickson, Bruce |4 edt | |
| 700 | 1 | |a Sullivan, Blair D. |4 aut | |
| 710 | 2 | |a Society for Industrial and Applied Mathematics |e Sonstige |0 (DE-588)5862-2 |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1137/1.9781611976830 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-72-SIA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032828333 | ||
| 966 | e | |u https://doi.org/10.1137/1.9781611976830 |l TUM01 |p ZDB-72-SIA |q TUM_Lizenz |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9781611976830 |l UBW01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9781611976830 |l UBY01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9781611976830 |l UER01 |p ZDB-72-SIA |q UER_Paketkauf |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182707758956544 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Sullivan, Blair D. |
| author2 | Bender, Michael Gilbert, John Hendrickson, Bruce |
| author2_role | edt edt edt |
| author2_variant | m b mb j g jg b h bh |
| author_corporate | SIAM Conference on Applied and Computational Discrete Algorithms |
| author_corporate_role | aut |
| author_facet | Sullivan, Blair D. Bender, Michael Gilbert, John Hendrickson, Bruce SIAM Conference on Applied and Computational Discrete Algorithms |
| author_role | aut |
| author_sort | SIAM Conference on Applied and Computational Discrete Algorithms |
| author_variant | b d s bd bds |
| building | Verbundindex |
| bvnumber | BV047425836 |
| collection | ZDB-72-SIA |
| contents | Queues with small advice / Michael Mitzenmacher -- The quantile matching problem and point cloud registration / Stéphane Chrétien, Oya Ekin Karaşan, Ecenur Oguz, and Mustafa Ç. Pınar -- Using predicted weights for ad delivery / Thomas Lavastida, Benjamin Moseley, R. Ravi, and Chenyang Xu -- Fully-dynamic weighted matching approximation in practice / Eugenio Angriman, Henning Meyerhenke, Christian Schulz, and Bora Uçar -- A parallel approximation algorithm for maximizing submodular b-matching / S.M Ferdous, Alex Pothen, Arif Khan, Ajay Panyala, and Mahantesh Halappanavar -- Non-monotone adaptive submodular meta-learning / Shaojie Tang and Jing Yuan -- Improving tug-of-war sketch using control-variates method / Rameshwar Pratap, Bhisham Dev Verma, and Raghav Kulkarni -- On the difference between search space size and query complexity in contraction hierarchies / Claudius Proissl and Tobias Rupp -- Fairmandering : a column generation heuristic for fairness-optimized political districting / Wes Gurnee and David B. Shmoys -- Faster parallel multiterminal cuts / Monika Henzinger, Alexander Noe, and Christian Schulz -- Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition / Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, and Blair D. Sullivan -- BELLA: Berkeley efficient long-read to long-read aligner and overlapper / Giulia Guidi, Marquita Ellis, Daniel Rokhsar, Katherine Yelick, and Aydın Buluç -- Parallel clique counting and peeling algorithms / Jessica Shi, Laxman Dhulipala, and Julian Shun -- A message-driven, multi-GPU parallel sparse triangular solver / Nan Ding, Yang Liu, Samuel Williams, and Xiaoye S. Li -- A dynamic program for computing the joint cumulative distribution function of order statistics / Rigel Galgana, Cengke Shi, Amy Greenwald, and Takehiro Oyakawa -- Efficient signed backward substitution for piecewise affine functions via path problems in a directed acyclic graph / Torsten Bosse, Ralf Seidler, and H. Martin Bücker -- Multidimensional included and excluded sums / Helen Xu, Sean Fraser, and Charles E. Leiserson -- Efficient parallel sparse symmetric tucker decomposition for high-order tensors / Shruti Shivakumar, Jiajia Li, Ramakrishnan Kannan, and Srinivas Aluru -- The traveling firefighter problem / Majid Farhadi, Alejandro Toriello, and Prasad Tetali -- Search and evacuation with a near majority of faulty agents / Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, and Grzegorz Stachowiak -- On the request-trip-vehicle assignment problem / J. Carlos Martínez Mori and Samitha Samaranayake |
| ctrlnum | (ZDB-72-SIA)978-1-61197-683-0 (OCoLC)1268188445 (DE-599)BVBBV047425836 |
| doi_str_mv | 10.1137/1.9781611976830 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05884nmm a2200553 c 4500</leader><controlfield tag="001">BV047425836</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20221017 </controlfield><controlfield tag="006">a |||| 10||| </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">210818s2021 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781611976830</subfield><subfield code="9">978-1-61197-683-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1611976839</subfield><subfield code="9">1611976839</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1137/1.9781611976830</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">ACDA21</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-72-SIA)978-1-61197-683-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1268188445</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047425836</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-91</subfield></datafield><datafield tag="110" ind1="2" ind2=" "><subfield code="a">SIAM Conference on Applied and Computational Discrete Algorithms</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21)</subfield><subfield code="c">editors Michael Bender ; John Gilbert ; Bruce Hendrickson ; Blair D. Sullivan</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">SIAM 2021 Conference on Applied & Computational Discrete Algorithms</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pennsylvania</subfield><subfield code="b">Society for Industrial and Applied Mathematics, SIAM</subfield><subfield code="c">[2021]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (239 Seiten)</subfield><subfield code="b">Illustrationen</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Queues with small advice / Michael Mitzenmacher -- The quantile matching problem and point cloud registration / Stéphane Chrétien, Oya Ekin Karaşan, Ecenur Oguz, and Mustafa Ç. Pınar -- Using predicted weights for ad delivery / Thomas Lavastida, Benjamin Moseley, R. Ravi, and Chenyang Xu -- Fully-dynamic weighted matching approximation in practice / Eugenio Angriman, Henning Meyerhenke, Christian Schulz, and Bora Uçar -- A parallel approximation algorithm for maximizing submodular b-matching / S.M Ferdous, Alex Pothen, Arif Khan, Ajay Panyala, and Mahantesh Halappanavar -- Non-monotone adaptive submodular meta-learning / Shaojie Tang and Jing Yuan -- Improving tug-of-war sketch using control-variates method / Rameshwar Pratap, Bhisham Dev Verma, and Raghav Kulkarni -- On the difference between search space size and query complexity in contraction hierarchies / Claudius Proissl and Tobias Rupp -- </subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Fairmandering : a column generation heuristic for fairness-optimized political districting / Wes Gurnee and David B. Shmoys -- Faster parallel multiterminal cuts / Monika Henzinger, Alexander Noe, and Christian Schulz -- Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition / Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, and Blair D. Sullivan -- BELLA: Berkeley efficient long-read to long-read aligner and overlapper / Giulia Guidi, Marquita Ellis, Daniel Rokhsar, Katherine Yelick, and Aydın Buluç -- Parallel clique counting and peeling algorithms / Jessica Shi, Laxman Dhulipala, and Julian Shun -- A message-driven, multi-GPU parallel sparse triangular solver / Nan Ding, Yang Liu, Samuel Williams, and Xiaoye S. Li -- A dynamic program for computing the joint cumulative distribution function of order statistics / Rigel Galgana, Cengke Shi, Amy Greenwald, and Takehiro Oyakawa -- </subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Efficient signed backward substitution for piecewise affine functions via path problems in a directed acyclic graph / Torsten Bosse, Ralf Seidler, and H. Martin Bücker -- Multidimensional included and excluded sums / Helen Xu, Sean Fraser, and Charles E. Leiserson -- Efficient parallel sparse symmetric tucker decomposition for high-order tensors / Shruti Shivakumar, Jiajia Li, Ramakrishnan Kannan, and Srinivas Aluru -- The traveling firefighter problem / Majid Farhadi, Alejandro Toriello, and Prasad Tetali -- Search and evacuation with a near majority of faulty agents / Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, and Grzegorz Stachowiak -- On the request-trip-vehicle assignment problem / J. Carlos Martínez Mori and Samitha Samaranayake</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The SIAM Conference on Applied and Computational Discrete Algorithms is a new conference that brings together researchers who design and study combinatorial and graph algorithms motivated by applications. ACDA is organized by SIAM under the auspices of the SIAM Activity Group on Applied and Computational Discrete Algorithms. ACDA subsumes the long-running series of SIAM Workshops on Combinatorial Scientific Computing, and expands its scope to applications of discrete models and algorithms across all areas in the physical and life sciences and engineering, the social and information sciences, and anywhere discrete mathematical techniques are used to formulate and solve problems in the world. ACDA invites papers on the formulation of combinatorial problems from applications; theoretical analyses; design of algorithms; computational evaluation of the algorithms; and deployment of the resulting software to enable applications</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Combinatorial analysis / Congresses</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Graph algorithms / Congresses</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Algorithms / Congresses</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bender, Michael</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gilbert, John</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hendrickson, Bruce</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sullivan, Blair D.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Society for Industrial and Applied Mathematics</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)5862-2</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1137/1.9781611976830</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-72-SIA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032828333</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611976830</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="q">TUM_Lizenz</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611976830</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611976830</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611976830</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="q">UER_Paketkauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV047425836 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T17:58:00Z |
| indexdate | 2024-07-10T09:11:50Z |
| institution | BVB |
| institution_GND | (DE-588)5862-2 |
| isbn | 9781611976830 1611976839 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032828333 |
| oclc_num | 1268188445 |
| open_access_boolean | |
| owner | DE-83 DE-20 DE-29 DE-706 DE-91 DE-BY-TUM |
| owner_facet | DE-83 DE-20 DE-29 DE-706 DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (239 Seiten) Illustrationen |
| psigel | ZDB-72-SIA ZDB-72-SIA TUM_Lizenz ZDB-72-SIA UER_Paketkauf |
| publishDate | 2021 |
| publishDateSearch | 2021 |
| publishDateSort | 2021 |
| publisher | Society for Industrial and Applied Mathematics, SIAM |
| record_format | marc |
| spelling | SIAM Conference on Applied and Computational Discrete Algorithms Verfasser aut Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21) editors Michael Bender ; John Gilbert ; Bruce Hendrickson ; Blair D. Sullivan SIAM 2021 Conference on Applied & Computational Discrete Algorithms Philadelphia, Pennsylvania Society for Industrial and Applied Mathematics, SIAM [2021] 1 Online-Ressource (239 Seiten) Illustrationen txt rdacontent c rdamedia cr rdacarrier Queues with small advice / Michael Mitzenmacher -- The quantile matching problem and point cloud registration / Stéphane Chrétien, Oya Ekin Karaşan, Ecenur Oguz, and Mustafa Ç. Pınar -- Using predicted weights for ad delivery / Thomas Lavastida, Benjamin Moseley, R. Ravi, and Chenyang Xu -- Fully-dynamic weighted matching approximation in practice / Eugenio Angriman, Henning Meyerhenke, Christian Schulz, and Bora Uçar -- A parallel approximation algorithm for maximizing submodular b-matching / S.M Ferdous, Alex Pothen, Arif Khan, Ajay Panyala, and Mahantesh Halappanavar -- Non-monotone adaptive submodular meta-learning / Shaojie Tang and Jing Yuan -- Improving tug-of-war sketch using control-variates method / Rameshwar Pratap, Bhisham Dev Verma, and Raghav Kulkarni -- On the difference between search space size and query complexity in contraction hierarchies / Claudius Proissl and Tobias Rupp -- Fairmandering : a column generation heuristic for fairness-optimized political districting / Wes Gurnee and David B. Shmoys -- Faster parallel multiterminal cuts / Monika Henzinger, Alexander Noe, and Christian Schulz -- Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition / Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, and Blair D. Sullivan -- BELLA: Berkeley efficient long-read to long-read aligner and overlapper / Giulia Guidi, Marquita Ellis, Daniel Rokhsar, Katherine Yelick, and Aydın Buluç -- Parallel clique counting and peeling algorithms / Jessica Shi, Laxman Dhulipala, and Julian Shun -- A message-driven, multi-GPU parallel sparse triangular solver / Nan Ding, Yang Liu, Samuel Williams, and Xiaoye S. Li -- A dynamic program for computing the joint cumulative distribution function of order statistics / Rigel Galgana, Cengke Shi, Amy Greenwald, and Takehiro Oyakawa -- Efficient signed backward substitution for piecewise affine functions via path problems in a directed acyclic graph / Torsten Bosse, Ralf Seidler, and H. Martin Bücker -- Multidimensional included and excluded sums / Helen Xu, Sean Fraser, and Charles E. Leiserson -- Efficient parallel sparse symmetric tucker decomposition for high-order tensors / Shruti Shivakumar, Jiajia Li, Ramakrishnan Kannan, and Srinivas Aluru -- The traveling firefighter problem / Majid Farhadi, Alejandro Toriello, and Prasad Tetali -- Search and evacuation with a near majority of faulty agents / Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, and Grzegorz Stachowiak -- On the request-trip-vehicle assignment problem / J. Carlos Martínez Mori and Samitha Samaranayake The SIAM Conference on Applied and Computational Discrete Algorithms is a new conference that brings together researchers who design and study combinatorial and graph algorithms motivated by applications. ACDA is organized by SIAM under the auspices of the SIAM Activity Group on Applied and Computational Discrete Algorithms. ACDA subsumes the long-running series of SIAM Workshops on Combinatorial Scientific Computing, and expands its scope to applications of discrete models and algorithms across all areas in the physical and life sciences and engineering, the social and information sciences, and anywhere discrete mathematical techniques are used to formulate and solve problems in the world. ACDA invites papers on the formulation of combinatorial problems from applications; theoretical analyses; design of algorithms; computational evaluation of the algorithms; and deployment of the resulting software to enable applications Combinatorial analysis / Congresses Graph algorithms / Congresses Algorithms / Congresses (DE-588)1071861417 Konferenzschrift gnd-content Bender, Michael edt Gilbert, John edt Hendrickson, Bruce edt Sullivan, Blair D. aut Society for Industrial and Applied Mathematics Sonstige (DE-588)5862-2 oth https://doi.org/10.1137/1.9781611976830 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Sullivan, Blair D. Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21) Queues with small advice / Michael Mitzenmacher -- The quantile matching problem and point cloud registration / Stéphane Chrétien, Oya Ekin Karaşan, Ecenur Oguz, and Mustafa Ç. Pınar -- Using predicted weights for ad delivery / Thomas Lavastida, Benjamin Moseley, R. Ravi, and Chenyang Xu -- Fully-dynamic weighted matching approximation in practice / Eugenio Angriman, Henning Meyerhenke, Christian Schulz, and Bora Uçar -- A parallel approximation algorithm for maximizing submodular b-matching / S.M Ferdous, Alex Pothen, Arif Khan, Ajay Panyala, and Mahantesh Halappanavar -- Non-monotone adaptive submodular meta-learning / Shaojie Tang and Jing Yuan -- Improving tug-of-war sketch using control-variates method / Rameshwar Pratap, Bhisham Dev Verma, and Raghav Kulkarni -- On the difference between search space size and query complexity in contraction hierarchies / Claudius Proissl and Tobias Rupp -- Fairmandering : a column generation heuristic for fairness-optimized political districting / Wes Gurnee and David B. Shmoys -- Faster parallel multiterminal cuts / Monika Henzinger, Alexander Noe, and Christian Schulz -- Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition / Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, and Blair D. Sullivan -- BELLA: Berkeley efficient long-read to long-read aligner and overlapper / Giulia Guidi, Marquita Ellis, Daniel Rokhsar, Katherine Yelick, and Aydın Buluç -- Parallel clique counting and peeling algorithms / Jessica Shi, Laxman Dhulipala, and Julian Shun -- A message-driven, multi-GPU parallel sparse triangular solver / Nan Ding, Yang Liu, Samuel Williams, and Xiaoye S. Li -- A dynamic program for computing the joint cumulative distribution function of order statistics / Rigel Galgana, Cengke Shi, Amy Greenwald, and Takehiro Oyakawa -- Efficient signed backward substitution for piecewise affine functions via path problems in a directed acyclic graph / Torsten Bosse, Ralf Seidler, and H. Martin Bücker -- Multidimensional included and excluded sums / Helen Xu, Sean Fraser, and Charles E. Leiserson -- Efficient parallel sparse symmetric tucker decomposition for high-order tensors / Shruti Shivakumar, Jiajia Li, Ramakrishnan Kannan, and Srinivas Aluru -- The traveling firefighter problem / Majid Farhadi, Alejandro Toriello, and Prasad Tetali -- Search and evacuation with a near majority of faulty agents / Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, and Grzegorz Stachowiak -- On the request-trip-vehicle assignment problem / J. Carlos Martínez Mori and Samitha Samaranayake |
| subject_GND | (DE-588)1071861417 |
| title | Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21) |
| title_alt | SIAM 2021 Conference on Applied & Computational Discrete Algorithms |
| title_auth | Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21) |
| title_exact_search | Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21) |
| title_exact_search_txtP | Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21) |
| title_full | Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21) editors Michael Bender ; John Gilbert ; Bruce Hendrickson ; Blair D. Sullivan |
| title_fullStr | Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21) editors Michael Bender ; John Gilbert ; Bruce Hendrickson ; Blair D. Sullivan |
| title_full_unstemmed | Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21) editors Michael Bender ; John Gilbert ; Bruce Hendrickson ; Blair D. Sullivan |
| title_short | Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21) |
| title_sort | proceedings of the 2021 siam conference on applied and computational discrete algorithms acda21 |
| topic_facet | Konferenzschrift |
| url | https://doi.org/10.1137/1.9781611976830 |
| work_keys_str_mv | AT siamconferenceonappliedandcomputationaldiscretealgorithms proceedingsofthe2021siamconferenceonappliedandcomputationaldiscretealgorithmsacda21 AT bendermichael proceedingsofthe2021siamconferenceonappliedandcomputationaldiscretealgorithmsacda21 AT gilbertjohn proceedingsofthe2021siamconferenceonappliedandcomputationaldiscretealgorithmsacda21 AT hendricksonbruce proceedingsofthe2021siamconferenceonappliedandcomputationaldiscretealgorithmsacda21 AT sullivanblaird proceedingsofthe2021siamconferenceonappliedandcomputationaldiscretealgorithmsacda21 AT societyforindustrialandappliedmathematics proceedingsofthe2021siamconferenceonappliedandcomputationaldiscretealgorithmsacda21 AT siamconferenceonappliedandcomputationaldiscretealgorithms siam2021conferenceonappliedcomputationaldiscretealgorithms AT bendermichael siam2021conferenceonappliedcomputationaldiscretealgorithms AT gilbertjohn siam2021conferenceonappliedcomputationaldiscretealgorithms AT hendricksonbruce siam2021conferenceonappliedcomputationaldiscretealgorithms AT sullivanblaird siam2021conferenceonappliedcomputationaldiscretealgorithms AT societyforindustrialandappliedmathematics siam2021conferenceonappliedcomputationaldiscretealgorithms |