Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: APPROX/RANDOM 2022, September 19–21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | Elektronisch Tagungsbericht E-Book |
| Sprache: | English |
| Veröffentlicht: |
Saarbrücken/Wadern
Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing
September, 2022
|
| Schriftenreihe: | LIPIcs - Leibniz International Proceedings in Informatics
Vol. 245 |
| Schlagworte: | |
| Online-Zugang: | Volltext https://d-nb.info/126894713X/34 kostenfrei Volltext |
| Beschreibung: | 1 Online-Ressource |
| ISBN: | 9783959772495 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV048512109 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 006 | a |||| 10||| | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 221014s2022 gw |||| o||u| ||||||eng d | ||
| 015 | |a 22,O10 |2 dnb | ||
| 016 | 7 | |a 126894713X |2 DE-101 | |
| 020 | |a 9783959772495 |9 978-3-95977-249-5 | ||
| 024 | 7 | |a urn:nbn:de:0030-drops-171211 |2 urn | |
| 035 | |a (OCoLC)1349544649 | ||
| 035 | |a (DE-599)DNB126894713X | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |8 3\p |a eng | |
| 044 | |a gw |c XA-DE-SL | ||
| 049 | |a DE-91 | ||
| 084 | |8 2\p |a 004 |2 23sdnb | ||
| 084 | |8 1\p |a 004.01 |2 23ksdnb | ||
| 111 | 2 | |a International Conference on Approximation Algorithms for Combinatorial Optimization Problems |n 25. |d 2022 |c Online |j Verfasser |0 (DE-588)1270288407 |4 aut | |
| 245 | 1 | 0 | |a Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques |b APPROX/RANDOM 2022, September 19–21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference) |c edited by Amit Chakrabarti, Chaitanya Swamy |
| 264 | 1 | |a Saarbrücken/Wadern |b Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing |c September, 2022 | |
| 300 | |a 1 Online-Ressource | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a LIPIcs - Leibniz International Proceedings in Informatics |v Vol. 245 | |
| 583 | 1 | |a Archivierung/Langzeitarchivierung gewährleistet |5 DE-101 |2 pdager | |
| 653 | |a LIPIcs, Volume 245, APPROX/RANDOM 2022, Complete Volume | ||
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 700 | 1 | |a Chakrabarti, Amit |4 edt | |
| 700 | 1 | |a Swamy, Chaitanya |4 edt | |
| 711 | 2 | |a International Conference on Randomization and Computation |n 26. |d 2022 |c Online |j Sonstige |0 (DE-588)1270288385 |4 oth | |
| 830 | 0 | |a LIPIcs - Leibniz International Proceedings in Informatics |v Vol. 245 |w (DE-604)BV039164160 |9 245 | |
| 856 | 4 | 0 | |u https://nbn-resolving.org/urn:nbn:de:0030-drops-171211 |x Resolving-System |z kostenfrei |3 Volltext |
| 856 | 4 | 0 | |u https://d-nb.info/126894713X/34 |x Langzeitarchivierung Nationalbibliothek |
| 856 | 4 | 0 | |q application/pdf |u https://www.dagstuhl.de/dagpub/978-3-95977-249-5 |x Verlag |z kostenfrei |
| 856 | 4 | 0 | |u https://drops.dagstuhl.de/opus/volltexte/2022/17121/pdf/lipics-vol245-approx-random2022-complete.pdf |x Verlag |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-033889133 | ||
| 883 | 0 | |8 1\p |a aepkn |c 0,93046 |d 20220928 |q DE-101 |u https://d-nb.info/provenance/plan#aepkn | |
| 883 | 0 | |8 2\p |a emasg |c 0,81154 |d 20220928 |q DE-101 |u https://d-nb.info/provenance/plan#emasg | |
| 883 | 1 | |8 3\p |a npi |d 20220927 |q DE-101 |u https://d-nb.info/provenance/plan#npi | |
Datensatz im Suchindex
| _version_ | 1804184489613590528 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author2 | Chakrabarti, Amit Swamy, Chaitanya |
| author2_role | edt edt |
| author2_variant | a c ac c s cs |
| author_corporate | International Conference on Approximation Algorithms for Combinatorial Optimization Problems Online |
| author_corporate_role | aut |
| author_facet | Chakrabarti, Amit Swamy, Chaitanya International Conference on Approximation Algorithms for Combinatorial Optimization Problems Online |
| author_sort | International Conference on Approximation Algorithms for Combinatorial Optimization Problems Online |
| building | Verbundindex |
| bvnumber | BV048512109 |
| collection | ebook |
| ctrlnum | (OCoLC)1349544649 (DE-599)DNB126894713X |
| format | Electronic Conference Proceeding eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02719nmm a2200529zcb4500</leader><controlfield tag="001">BV048512109</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="006">a |||| 10||| </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">221014s2022 gw |||| o||u| ||||||eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">22,O10</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">126894713X</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783959772495</subfield><subfield code="9">978-3-95977-249-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">urn:nbn:de:0030-drops-171211</subfield><subfield code="2">urn</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1349544649</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB126894713X</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="8">3\p</subfield><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-SL</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="8">2\p</subfield><subfield code="a">004</subfield><subfield code="2">23sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="8">1\p</subfield><subfield code="a">004.01</subfield><subfield code="2">23ksdnb</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">International Conference on Approximation Algorithms for Combinatorial Optimization Problems</subfield><subfield code="n">25.</subfield><subfield code="d">2022</subfield><subfield code="c">Online</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1270288407</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques</subfield><subfield code="b">APPROX/RANDOM 2022, September 19–21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)</subfield><subfield code="c">edited by Amit Chakrabarti, Chaitanya Swamy</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Saarbrücken/Wadern</subfield><subfield code="b">Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing</subfield><subfield code="c">September, 2022</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</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="490" ind1="1" ind2=" "><subfield code="a">LIPIcs - Leibniz International Proceedings in Informatics</subfield><subfield code="v">Vol. 245</subfield></datafield><datafield tag="583" ind1="1" ind2=" "><subfield code="a">Archivierung/Langzeitarchivierung gewährleistet</subfield><subfield code="5">DE-101</subfield><subfield code="2">pdager</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">LIPIcs, Volume 245, APPROX/RANDOM 2022, Complete Volume</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">Chakrabarti, Amit</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Swamy, Chaitanya</subfield><subfield code="4">edt</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">International Conference on Randomization and Computation</subfield><subfield code="n">26.</subfield><subfield code="d">2022</subfield><subfield code="c">Online</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)1270288385</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">LIPIcs - Leibniz International Proceedings in Informatics</subfield><subfield code="v">Vol. 245</subfield><subfield code="w">(DE-604)BV039164160</subfield><subfield code="9">245</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://nbn-resolving.org/urn:nbn:de:0030-drops-171211</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://d-nb.info/126894713X/34</subfield><subfield code="x">Langzeitarchivierung Nationalbibliothek</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="q">application/pdf</subfield><subfield code="u">https://www.dagstuhl.de/dagpub/978-3-95977-249-5</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://drops.dagstuhl.de/opus/volltexte/2022/17121/pdf/lipics-vol245-approx-random2022-complete.pdf</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-033889133</subfield></datafield><datafield tag="883" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">aepkn</subfield><subfield code="c">0,93046</subfield><subfield code="d">20220928</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#aepkn</subfield></datafield><datafield tag="883" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">emasg</subfield><subfield code="c">0,81154</subfield><subfield code="d">20220928</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#emasg</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">npi</subfield><subfield code="d">20220927</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#npi</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV048512109 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T20:47:55Z |
| indexdate | 2024-07-10T09:40:09Z |
| institution | BVB |
| institution_GND | (DE-588)1270288407 (DE-588)1270288385 |
| isbn | 9783959772495 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-033889133 |
| oclc_num | 1349544649 |
| open_access_boolean | 1 |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource |
| psigel | ebook |
| publishDate | 2022 |
| publishDateSearch | 2022 |
| publishDateSort | 2022 |
| publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing |
| record_format | marc |
| series | LIPIcs - Leibniz International Proceedings in Informatics |
| series2 | LIPIcs - Leibniz International Proceedings in Informatics |
| spelling | International Conference on Approximation Algorithms for Combinatorial Optimization Problems 25. 2022 Online Verfasser (DE-588)1270288407 aut Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2022, September 19–21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference) edited by Amit Chakrabarti, Chaitanya Swamy Saarbrücken/Wadern Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing September, 2022 1 Online-Ressource txt rdacontent c rdamedia cr rdacarrier LIPIcs - Leibniz International Proceedings in Informatics Vol. 245 Archivierung/Langzeitarchivierung gewährleistet DE-101 pdager LIPIcs, Volume 245, APPROX/RANDOM 2022, Complete Volume (DE-588)1071861417 Konferenzschrift gnd-content Chakrabarti, Amit edt Swamy, Chaitanya edt International Conference on Randomization and Computation 26. 2022 Online Sonstige (DE-588)1270288385 oth LIPIcs - Leibniz International Proceedings in Informatics Vol. 245 (DE-604)BV039164160 245 https://nbn-resolving.org/urn:nbn:de:0030-drops-171211 Resolving-System kostenfrei Volltext https://d-nb.info/126894713X/34 Langzeitarchivierung Nationalbibliothek application/pdf https://www.dagstuhl.de/dagpub/978-3-95977-249-5 Verlag kostenfrei https://drops.dagstuhl.de/opus/volltexte/2022/17121/pdf/lipics-vol245-approx-random2022-complete.pdf Verlag kostenfrei Volltext 1\p aepkn 0,93046 20220928 DE-101 https://d-nb.info/provenance/plan#aepkn 2\p emasg 0,81154 20220928 DE-101 https://d-nb.info/provenance/plan#emasg 3\p npi 20220927 DE-101 https://d-nb.info/provenance/plan#npi |
| spellingShingle | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2022, September 19–21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference) LIPIcs - Leibniz International Proceedings in Informatics |
| subject_GND | (DE-588)1071861417 |
| title | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2022, September 19–21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference) |
| title_auth | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2022, September 19–21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference) |
| title_exact_search | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2022, September 19–21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference) |
| title_exact_search_txtP | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2022, September 19–21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference) |
| title_full | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2022, September 19–21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference) edited by Amit Chakrabarti, Chaitanya Swamy |
| title_fullStr | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2022, September 19–21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference) edited by Amit Chakrabarti, Chaitanya Swamy |
| title_full_unstemmed | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques APPROX/RANDOM 2022, September 19–21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference) edited by Amit Chakrabarti, Chaitanya Swamy |
| title_short | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques |
| title_sort | approximation randomization and combinatorial optimization algorithms and techniques approx random 2022 september 19 21 2022 university of illinois urbana champaign usa virtual conference |
| title_sub | APPROX/RANDOM 2022, September 19–21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference) |
| topic_facet | Konferenzschrift |
| url | https://nbn-resolving.org/urn:nbn:de:0030-drops-171211 https://d-nb.info/126894713X/34 https://www.dagstuhl.de/dagpub/978-3-95977-249-5 https://drops.dagstuhl.de/opus/volltexte/2022/17121/pdf/lipics-vol245-approx-random2022-complete.pdf |
| volume_link | (DE-604)BV039164160 |
| work_keys_str_mv | AT internationalconferenceonapproximationalgorithmsforcombinatorialoptimizationproblemsonline approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2022september19212022universityofillinoisurbanachampaignusavirtualconference AT chakrabartiamit approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2022september19212022universityofillinoisurbanachampaignusavirtualconference AT swamychaitanya approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2022september19212022universityofillinoisurbanachampaignusavirtualconference AT internationalconferenceonrandomizationandcomputationonline approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniquesapproxrandom2022september19212022universityofillinoisurbanachampaignusavirtualconference |