Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere beteiligte Personen: | , , , |
| Format: | Elektronisch Tagungsbericht E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Saarbrücken/Wadern
Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing
August, 2018
|
| Schriftenreihe: | LIPIcs
Vol. 116 |
| Schlagwörter: | |
| Links: | http://d-nb.info/1165604485/34 http://drops.dagstuhl.de/opus/volltexte/lipics-complete/lipics-vol116-approx-random2018-complete.pdf https://nbn-resolving.org/urn:nbn:de:0030-drops-95377 http://www.dagstuhl.de/dagpub/978-3-95977-085-9 |
| Umfang: | 1 Online-Ressource |
| Format: | Langzeitarchivierung gewährleistet, LZA |
| ISBN: | 9783959770859 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV045168020 | ||
| 003 | DE-604 | ||
| 005 | 20190717 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 180905s2018 gw o|||| 10||| eng d | ||
| 015 | |a 18,O09 |2 dnb | ||
| 016 | 7 | |a 1165604485 |2 DE-101 | |
| 020 | |a 9783959770859 |9 978-3-95977-085-9 | ||
| 024 | 7 | |a urn:nbn:de:0030-drops-95377 |2 urn | |
| 035 | |a (OCoLC)1051248611 | ||
| 035 | |a (DE-599)DNB1165604485 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-SL | ||
| 049 | |a DE-91 | ||
| 084 | |a DAT 530f |2 stub | ||
| 084 | |a MAT 410f |2 stub | ||
| 084 | |a MAT 913f |2 stub | ||
| 111 | 2 | |a APPROX |n 21. |d 2018 |c Princeton, NJ |j Verfasser |0 (DE-588)1166262464 |4 aut | |
| 245 | 1 | 0 | |a Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques |b 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA |c edited by Eric Blais, Klaus Jansen, José D. P. Rolim, David Steurer |
| 264 | 1 | |a Saarbrücken/Wadern |b Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing |c August, 2018 | |
| 300 | |a 1 Online-Ressource | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a LIPIcs |v Vol. 116 | |
| 538 | |a Langzeitarchivierung gewährleistet, LZA | ||
| 650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Zufall |0 (DE-588)4068050-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 653 | |a Mathematics of computing, Theory of computation | ||
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Zufall |0 (DE-588)4068050-2 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Blais, Eric |4 edt | |
| 700 | 1 | |a Jansen, Klaus |d 1961- |0 (DE-588)1011509512 |4 edt | |
| 700 | 1 | |a Rolim, José D.P. |d 1956- |0 (DE-588)1089310528 |4 edt | |
| 700 | 1 | |a Steurer, David |4 edt | |
| 711 | 2 | |a RANDOM |n 22. |d 2018 |c Princeton, NJ |j Sonstige |0 (DE-588)1166262715 |4 oth | |
| 830 | 0 | |a LIPIcs |v Vol. 116 |w (DE-604)BV039164160 |9 116 | |
| 856 | 4 | 0 | |u http://d-nb.info/1165604485/34 |x Langzeitarchivierung Nationalbibliothek |z kostenfrei |3 Volltext |
| 856 | 4 | 0 | |u http://drops.dagstuhl.de/opus/volltexte/lipics-complete/lipics-vol116-approx-random2018-complete.pdf |x Verlag |z kostenfrei |
| 856 | 4 | 0 | |u https://nbn-resolving.org/urn:nbn:de:0030-drops-95377 |x Resolving-System |z kostenfrei |
| 856 | 4 | 0 | |u http://www.dagstuhl.de/dagpub/978-3-95977-085-9 |x Verlag |z kostenfrei |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-030557386 | |
Datensatz im Suchindex
| DE-BY-TUM_katkey | 2362743 |
|---|---|
| _version_ | 1821935864941379586 |
| any_adam_object | |
| author2 | Blais, Eric Jansen, Klaus 1961- Rolim, José D.P. 1956- Steurer, David |
| author2_role | edt edt edt edt |
| author2_variant | e b eb k j kj j d r jd jdr d s ds |
| author_GND | (DE-588)1011509512 (DE-588)1089310528 |
| author_corporate | APPROX Princeton, NJ |
| author_corporate_role | aut |
| author_facet | Blais, Eric Jansen, Klaus 1961- Rolim, José D.P. 1956- Steurer, David APPROX Princeton, NJ |
| author_sort | APPROX Princeton, NJ |
| building | Verbundindex |
| bvnumber | BV045168020 |
| classification_tum | DAT 530f MAT 410f MAT 913f |
| ctrlnum | (OCoLC)1051248611 (DE-599)DNB1165604485 |
| discipline | Informatik Mathematik |
| format | Electronic Conference Proceeding eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02857nam a2200637zcb4500</leader><controlfield tag="001">BV045168020</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190717 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180905s2018 gw o|||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">18,O09</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1165604485</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783959770859</subfield><subfield code="9">978-3-95977-085-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">urn:nbn:de:0030-drops-95377</subfield><subfield code="2">urn</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1051248611</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1165604485</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="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="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 410f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 913f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">APPROX</subfield><subfield code="n">21.</subfield><subfield code="d">2018</subfield><subfield code="c">Princeton, NJ</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1166262464</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">21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA</subfield><subfield code="c">edited by Eric Blais, Klaus Jansen, José D. P. Rolim, David Steurer</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">August, 2018</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</subfield><subfield code="v">Vol. 116</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Langzeitarchivierung gewährleistet, LZA</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zufall</subfield><subfield code="0">(DE-588)4068050-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematics of computing, Theory of computation</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="689" ind1="0" ind2="0"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Zufall</subfield><subfield code="0">(DE-588)4068050-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Blais, Eric</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jansen, Klaus</subfield><subfield code="d">1961-</subfield><subfield code="0">(DE-588)1011509512</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rolim, José D.P.</subfield><subfield code="d">1956-</subfield><subfield code="0">(DE-588)1089310528</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Steurer, David</subfield><subfield code="4">edt</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">RANDOM</subfield><subfield code="n">22.</subfield><subfield code="d">2018</subfield><subfield code="c">Princeton, NJ</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)1166262715</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">LIPIcs</subfield><subfield code="v">Vol. 116</subfield><subfield code="w">(DE-604)BV039164160</subfield><subfield code="9">116</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://d-nb.info/1165604485/34</subfield><subfield code="x">Langzeitarchivierung Nationalbibliothek</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://drops.dagstuhl.de/opus/volltexte/lipics-complete/lipics-vol116-approx-random2018-complete.pdf</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://nbn-resolving.org/urn:nbn:de:0030-drops-95377</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.dagstuhl.de/dagpub/978-3-95977-085-9</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030557386</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV045168020 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T18:19:50Z |
| institution | BVB |
| institution_GND | (DE-588)1166262464 (DE-588)1166262715 |
| isbn | 9783959770859 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030557386 |
| oclc_num | 1051248611 |
| open_access_boolean | 1 |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource |
| publishDate | 2018 |
| publishDateSearch | 2018 |
| publishDateSort | 2018 |
| publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing |
| record_format | marc |
| series | LIPIcs |
| series2 | LIPIcs |
| spellingShingle | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA LIPIcs Kombinatorische Optimierung (DE-588)4031826-6 gnd Zufall (DE-588)4068050-2 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4031826-6 (DE-588)4068050-2 (DE-588)4500954-5 (DE-588)4001183-5 (DE-588)1071861417 |
| title | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA |
| title_auth | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA |
| title_exact_search | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA |
| title_full | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA edited by Eric Blais, Klaus Jansen, José D. P. Rolim, David Steurer |
| title_fullStr | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA edited by Eric Blais, Klaus Jansen, José D. P. Rolim, David Steurer |
| title_full_unstemmed | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA edited by Eric Blais, Klaus Jansen, José D. P. Rolim, David Steurer |
| title_short | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques |
| title_sort | approximation randomization and combinatorial optimization algorithms and techniques 21st international workshop approx 2018 and 22nd international workshop random 2018 august 20 22 2018 princeton usa |
| title_sub | 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA |
| topic | Kombinatorische Optimierung (DE-588)4031826-6 gnd Zufall (DE-588)4068050-2 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Kombinatorische Optimierung Zufall Approximationsalgorithmus Algorithmus Konferenzschrift |
| url | http://d-nb.info/1165604485/34 http://drops.dagstuhl.de/opus/volltexte/lipics-complete/lipics-vol116-approx-random2018-complete.pdf https://nbn-resolving.org/urn:nbn:de:0030-drops-95377 http://www.dagstuhl.de/dagpub/978-3-95977-085-9 |
| volume_link | (DE-604)BV039164160 |
| work_keys_str_mv | AT approxprincetonnj approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques21stinternationalworkshopapprox2018and22ndinternationalworkshoprandom2018august20222018princetonusa AT blaiseric approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques21stinternationalworkshopapprox2018and22ndinternationalworkshoprandom2018august20222018princetonusa AT jansenklaus approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques21stinternationalworkshopapprox2018and22ndinternationalworkshoprandom2018august20222018princetonusa AT rolimjosedp approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques21stinternationalworkshopapprox2018and22ndinternationalworkshoprandom2018august20222018princetonusa AT steurerdavid approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques21stinternationalworkshopapprox2018and22ndinternationalworkshoprandom2018august20222018princetonusa AT randomprincetonnj approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques21stinternationalworkshopapprox2018and22ndinternationalworkshoprandom2018august20222018princetonusa |