Approximation, randomization, and combinatorial optimization: algorithms and techniques ; 15th international workshop, APPROX 2012 and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15 - 17, 2012 ; proceedings
Gespeichert in:
Format: | Elektronisch Tagungsbericht E-Book |
---|---|
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
2012
|
Schriftenreihe: | Lecture Notes in Computer Science
7408 |
Schlagworte: | |
Online-Zugang: | Volltext |
Beschreibung: | 1 Online-Ressource (XV, 674 S.) graph. Darst. |
ISBN: | 9783642325120 |
DOI: | 10.1007/978-3-642-32512-0 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV040345833 | ||
003 | DE-604 | ||
007 | cr|uuu---uuuuu | ||
008 | 120801s2012 xx d||| o|||| 10||| eng d | ||
020 | |a 9783642325120 |c eISBN |9 978-3-642-32512-0 | ||
024 | 7 | |a 10.1007/978-3-642-32512-0 |2 doi | |
035 | |a (OCoLC)891102482 | ||
035 | |a (DE-599)BVBBV040345833 | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
049 | |a DE-473 |a DE-20 |a DE-91 |a DE-739 |a DE-384 |a DE-M347 |a DE-703 |a DE-19 |a DE-355 |a DE-92 |a DE-Aug4 |a DE-859 |a DE-634 |a DE-706 | ||
082 | 0 | |a 005.1 | |
084 | |a DAT 000 |2 stub | ||
245 | 1 | 0 | |a Approximation, randomization, and combinatorial optimization |b algorithms and techniques ; 15th international workshop, APPROX 2012 and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15 - 17, 2012 ; proceedings |c Anupam Gupta ... (eds.) |
264 | 1 | |a Berlin [u.a.] |b Springer |c 2012 | |
300 | |a 1 Online-Ressource (XV, 674 S.) |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 1 | |a Lecture Notes in Computer Science |v 7408 | |
650 | 4 | |a Datenverarbeitung | |
650 | 4 | |a Informatik | |
650 | 4 | |a Computer science | |
650 | 4 | |a Computer software | |
650 | 4 | |a Electronic data processing | |
650 | 4 | |a Computational complexity | |
650 | 4 | |a Computer vision | |
650 | 4 | |a Computer Science | |
650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-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 Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Randomisierung |0 (DE-588)4280827-3 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
689 | 0 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
689 | 0 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
689 | 0 | 2 | |a Randomisierung |0 (DE-588)4280827-3 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
689 | 1 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
689 | 1 | 1 | |a Approximation |0 (DE-588)4002498-2 |D s |
689 | 1 | |8 2\p |5 DE-604 | |
689 | 2 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
689 | 2 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
689 | 2 | |8 3\p |5 DE-604 | |
700 | 1 | |a Gupta, Anupam |e Sonstige |0 (DE-588)171206088 |4 oth | |
711 | 2 | |a APPROX |n 15 |d 2012 |c Cambridge, Mass. |j Sonstige |0 (DE-588)1024760510 |4 oth | |
711 | 2 | |a RANDOM |n 16 |d 2012 |c Cambridge, Mass. |j Sonstige |0 (DE-588)1024760707 |4 oth | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 978-3-642-32511-3 |
830 | 0 | |a Lecture Notes in Computer Science |v 7408 |w (DE-604)BV014880109 |9 7408 | |
856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-32512-0 |x Verlag |3 Volltext |
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
912 | |a ZDB-2-LNC | ||
912 | |a ZDB-2-SCS | ||
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-025199988 |
Datensatz im Suchindex
_version_ | 1820875407580200960 |
---|---|
adam_text | |
any_adam_object | |
author_GND | (DE-588)171206088 |
building | Verbundindex |
bvnumber | BV040345833 |
classification_rvk | SS 4800 |
classification_tum | DAT 000 |
collection | ZDB-2-LNC ZDB-2-SCS |
ctrlnum | (OCoLC)891102482 (DE-599)BVBBV040345833 |
dewey-full | 005.1 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.1 |
dewey-search | 005.1 |
dewey-sort | 15.1 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
doi_str_mv | 10.1007/978-3-642-32512-0 |
format | Electronic Conference Proceeding eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV040345833</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">120801s2012 xx d||| o|||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642325120</subfield><subfield code="c">eISBN</subfield><subfield code="9">978-3-642-32512-0</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-32512-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)891102482</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV040345833</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximation, randomization, and combinatorial optimization</subfield><subfield code="b">algorithms and techniques ; 15th international workshop, APPROX 2012 and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15 - 17, 2012 ; proceedings</subfield><subfield code="c">Anupam Gupta ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XV, 674 S.)</subfield><subfield code="b">graph. Darst.</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">Lecture Notes in Computer Science</subfield><subfield code="v">7408</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer vision</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Randomisierung</subfield><subfield code="0">(DE-588)4280827-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="2"><subfield code="a">Randomisierung</subfield><subfield code="0">(DE-588)4280827-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2="1"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><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="1"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gupta, Anupam</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)171206088</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">APPROX</subfield><subfield code="n">15</subfield><subfield code="d">2012</subfield><subfield code="c">Cambridge, Mass.</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)1024760510</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">RANDOM</subfield><subfield code="n">16</subfield><subfield code="d">2012</subfield><subfield code="c">Cambridge, Mass.</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)1024760707</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">978-3-642-32511-3</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture Notes in Computer Science</subfield><subfield code="v">7408</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">7408</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-32512-0</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-025199988</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift gnd-content |
genre_facet | Konferenzschrift |
id | DE-604.BV040345833 |
illustrated | Illustrated |
indexdate | 2025-01-10T15:15:09Z |
institution | BVB |
institution_GND | (DE-588)1024760510 (DE-588)1024760707 |
isbn | 9783642325120 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-025199988 |
oclc_num | 891102482 |
open_access_boolean | |
owner | DE-473 DE-BY-UBG DE-20 DE-91 DE-BY-TUM DE-739 DE-384 DE-M347 DE-703 DE-19 DE-BY-UBM DE-355 DE-BY-UBR DE-92 DE-Aug4 DE-859 DE-634 DE-706 |
owner_facet | DE-473 DE-BY-UBG DE-20 DE-91 DE-BY-TUM DE-739 DE-384 DE-M347 DE-703 DE-19 DE-BY-UBM DE-355 DE-BY-UBR DE-92 DE-Aug4 DE-859 DE-634 DE-706 |
physical | 1 Online-Ressource (XV, 674 S.) graph. Darst. |
psigel | ZDB-2-LNC ZDB-2-SCS |
publishDate | 2012 |
publishDateSearch | 2012 |
publishDateSort | 2012 |
publisher | Springer |
record_format | marc |
series | Lecture Notes in Computer Science |
series2 | Lecture Notes in Computer Science |
spelling | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 15th international workshop, APPROX 2012 and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15 - 17, 2012 ; proceedings Anupam Gupta ... (eds.) Berlin [u.a.] Springer 2012 1 Online-Ressource (XV, 674 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Lecture Notes in Computer Science 7408 Datenverarbeitung Informatik Computer science Computer software Electronic data processing Computational complexity Computer vision Computer Science Approximation (DE-588)4002498-2 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Randomisierung (DE-588)4280827-3 gnd rswk-swf (DE-588)1071861417 Konferenzschrift gnd-content Komplexitätstheorie (DE-588)4120591-1 s Approximationsalgorithmus (DE-588)4500954-5 s Randomisierung (DE-588)4280827-3 s 1\p DE-604 Kombinatorische Optimierung (DE-588)4031826-6 s Approximation (DE-588)4002498-2 s 2\p DE-604 3\p DE-604 Gupta, Anupam Sonstige (DE-588)171206088 oth APPROX 15 2012 Cambridge, Mass. Sonstige (DE-588)1024760510 oth RANDOM 16 2012 Cambridge, Mass. Sonstige (DE-588)1024760707 oth Erscheint auch als Druck-Ausgabe, Paperback 978-3-642-32511-3 Lecture Notes in Computer Science 7408 (DE-604)BV014880109 7408 https://doi.org/10.1007/978-3-642-32512-0 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 15th international workshop, APPROX 2012 and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15 - 17, 2012 ; proceedings Lecture Notes in Computer Science Datenverarbeitung Informatik Computer science Computer software Electronic data processing Computational complexity Computer vision Computer Science Approximation (DE-588)4002498-2 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Randomisierung (DE-588)4280827-3 gnd |
subject_GND | (DE-588)4002498-2 (DE-588)4500954-5 (DE-588)4120591-1 (DE-588)4031826-6 (DE-588)4280827-3 (DE-588)1071861417 |
title | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 15th international workshop, APPROX 2012 and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15 - 17, 2012 ; proceedings |
title_auth | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 15th international workshop, APPROX 2012 and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15 - 17, 2012 ; proceedings |
title_exact_search | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 15th international workshop, APPROX 2012 and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15 - 17, 2012 ; proceedings |
title_full | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 15th international workshop, APPROX 2012 and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15 - 17, 2012 ; proceedings Anupam Gupta ... (eds.) |
title_fullStr | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 15th international workshop, APPROX 2012 and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15 - 17, 2012 ; proceedings Anupam Gupta ... (eds.) |
title_full_unstemmed | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 15th international workshop, APPROX 2012 and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15 - 17, 2012 ; proceedings Anupam Gupta ... (eds.) |
title_short | Approximation, randomization, and combinatorial optimization |
title_sort | approximation randomization and combinatorial optimization algorithms and techniques 15th international workshop approx 2012 and 16th international workshop random 2012 cambridge ma usa august 15 17 2012 proceedings |
title_sub | algorithms and techniques ; 15th international workshop, APPROX 2012 and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15 - 17, 2012 ; proceedings |
topic | Datenverarbeitung Informatik Computer science Computer software Electronic data processing Computational complexity Computer vision Computer Science Approximation (DE-588)4002498-2 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Randomisierung (DE-588)4280827-3 gnd |
topic_facet | Datenverarbeitung Informatik Computer science Computer software Electronic data processing Computational complexity Computer vision Computer Science Approximation Approximationsalgorithmus Komplexitätstheorie Kombinatorische Optimierung Randomisierung Konferenzschrift |
url | https://doi.org/10.1007/978-3-642-32512-0 |
volume_link | (DE-604)BV014880109 |
work_keys_str_mv | AT guptaanupam approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques15thinternationalworkshopapprox2012and16thinternationalworkshoprandom2012cambridgemausaaugust15172012proceedings AT approxcambridgemass approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques15thinternationalworkshopapprox2012and16thinternationalworkshoprandom2012cambridgemausaaugust15172012proceedings AT randomcambridgemass approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques15thinternationalworkshopapprox2012and16thinternationalworkshoprandom2012cambridgemausaaugust15172012proceedings |