Approximation, randomization, and combinatorial optimization: algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2009
|
| Schriftenreihe: | Lecture notes in computer science
5687 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XII, 740 S. 235 mm x 155 mm |
| ISBN: | 9783642036842 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035681082 | ||
| 003 | DE-604 | ||
| 005 | 20091028 | ||
| 007 | t| | ||
| 008 | 090817s2009 xx |||| 00||| eng d | ||
| 015 | |a 09,N31,0008 |2 dnb | ||
| 016 | 7 | |a 995338590 |2 DE-101 | |
| 020 | |a 9783642036842 |c PB. : EUR 90.90 (freier Pr.), sfr 132.00 (freier Pr.) |9 978-3-642-03684-2 | ||
| 020 | |z 36420636848 |9 3-642-063684-8 | ||
| 024 | 3 | |a 9783642036842 | |
| 035 | |a (OCoLC)436909824 | ||
| 035 | |a (DE-599)DNB995338590 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 |a DE-91G |a DE-83 |a DE-11 | ||
| 050 | 0 | |a QA75.5 | |
| 082 | 0 | |a 004.015114 |b I61 A12 | |
| 084 | |a MAT 913f |2 stub | ||
| 084 | |a 004 |2 sdnb | ||
| 084 | |a DAT 537f |2 stub | ||
| 084 | |a MAT 410f |2 stub | ||
| 084 | |a 510 |2 sdnb | ||
| 084 | |a DAT 517f |2 stub | ||
| 245 | 1 | 0 | |a Approximation, randomization, and combinatorial optimization |b algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings |c Irit Dinur ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2009 | |
| 300 | |a XII, 740 S. |c 235 mm x 155 mm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 5687 | |
| 650 | 4 | |a Approximationsalgorithmus - Randomisierung - Kongress - Berkeley <Calif., 2009> | |
| 650 | 4 | |a Kombinatorische Optimierung - Approximationsalgorithmus - Kongress - Berkeley <Calif., 2009> | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Computer algorithms |v Congresses | |
| 650 | 4 | |a Computer science |x Statistical methods |v Congresses | |
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |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 |y 2009 |z Berkeley Calif. |2 gnd-content | |
| 689 | 0 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 0 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 1 | 1 | |a Randomisierung |0 (DE-588)4280827-3 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Dinur, Irit |e Sonstige |4 oth | |
| 711 | 2 | |a APPROX |n 12 |d 2009 |c Berkeley, Calif. |j Sonstige |0 (DE-588)16177950-5 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 5687 |w (DE-604)BV000000607 |9 5687 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017735347&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-017735347 | |
Datensatz im Suchindex
| _version_ | 1826212240448028672 |
|---|---|
| adam_text |
TABLE OF CONTENTS
CONTRIBUTED TALKS OF APPROX
APPROXIMATION
ALGORITHMS
AND
HARDNESS RESULTS
FOR
PACKING
ELEMENT-DISJOINT
STEINER TREES
IN
PLANAR GRAPHS
1
ASHKAN AAZAMI, JOSEPH CHERIYAN, AND KRISHNAM RAJU JAMPANI
ADAPTIVE SAMPLING
FOR
FC-MEANS CLUSTERING
15
ANKIT AGGARWAL, AMIT DESHPANDE, AND RAVI KANNAN
APPROXIMATIONS
FOR
ALIGNED COLORING AND SPILLAGE MINIMIZATION
IN
INTERVAL
AND CHORDAL GRAPHS
29
DOUGLAS
E.
CARROLL, ADAM MEYERSON, AND BRIAN TAGIKU
UNSPLITTABLE FLOW
IN
PATHS
AND
TREES
AND
COLUMN-RESTRICTED PACKING
INTEGER
PROGRAMS
42
CHANDRA CHEKURI, ALINA ENE, AND NITISH KORULA
TRUTHFUL MECHANISMS VIA GREEDY ITERATIVE PACKING
56
CHANDRA CHEKURI AND IFTAH GAMZU
RESOURCE MINIMIZATION JOB SCHEDULING
70
JULIA CHUZHOY AND PAOLO CODENOTTI
THE POWER
OF
PREEMPTION
ON
UNRELATED MACHINES
AND
APPLICATIONS
TO
SCHEDULING
ORDERS
84
JOSE
R.
CORREA, MARTIN SKUTELLA, AND JOSE VERSCHAE
NEW HARDNESS RESULTS
FOR
DIOPHANTINE APPROXIMATION
98
FRIEDRICH EISENBRAND AND THOMAS ROTHVOSS
PASS APPROXIMATION:
A
FRAMEWORK
FOR
ANALYZING
AND
DESIGNING
HEURISTICS
ILL
URIEL FEIGE, NICOLE IMMORLICA, VAHAB
S.
MIRROKNI.
AND
HAMID
NAZERZADEH
OPTIMAL SHERALI-ADAMS GAPS FROM PAIRWISE INDEPENDENCE
125
KONSTANTINOS
GEORGIOU, AVNER MAGEN, AND MADHUR TULSIANI
AN APPROXIMATION SCHEME
FOR
TERRAIN GUARDING
140
MATT GIBSON, GAURAV KANADE. ERIK KROHN. AND KASTURI VARADARAJAN
SCHEDULING WITH OUTLIERS
149
ANUPAM GUPTA, RAVISHANKAR KRISHNASIUAMY. AMIT KUMAR,
AND
DANNY
SEGEV
BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/995338590
DIGITALISIERT DURCH
X TABLE OF CONTENTS
IMPROVED INAPPROXIMABILITY RESULTS FOR MAXIMUM A;-COLORABLE
SUBGRAPH
163
VENKATESAN GURUSWAMI AND ALI KEMAL SINOP
IMPROVED ABSOLUTE APPROXIMATION RATIOS FOR TWO-DIMENSIONAL
PACKING
PROBLEMS 177
ROLF HARREN AND ROB VAN STEE
ON THE OPTIMALITY OF GLUING OVER SCALES 190
ALEX JAFFE, JAMES R. LEE, AND MOHAMMAD MOHARRAMI
ON HARDNESS OF PRICING ITEMS FOR SINGLE-MINDED BIDDERS 202
ROHIT KHANDEKAR, TRACY KIMBREL, KONSTANTIN MAKARYCHEV, AND
MAXIM
SVIRIDENKO
REAL-TIME MESSAGE ROUTING AND SCHEDULING 217
RONALD KOCH. BRITTA PEIS, MARTIN SKUTELLA, AND ANDREAS WIESE
APPROXIMATING SOME NETWORK DESIGN PROBLEMS WITH NODE COSTS 231
GUY
KORTSARZ AND ZEEV NUTOV
SUBMODULAR MAXIMIZATION OVER MULTIPLE MATROIDS VIA GENERALIZED
EXCHANGE
PROPERTIES 244
JON LEE, MAXIM SVIRIDENKO, AND JAN VONDRAK
ROBUST ALGORITHMS FOR
MAX INDEPENDENT SET
ON MINOR-FREE GRAPHS
BASED
ON THE SHERALI-ADAMS HIERARCHY 258
AVNER MAGEN AND MOHAMMAD MOHARRAMI
MINIMIZING AVERAGE SHORTEST PATH DISTANCES VIA SHORTCUT EDGE
ADDITION
272
ADAM MEYERSON AND BRIAN TAGIKU
APPROXIMATING NODE-CONNECTIVITY AUGMENTATION PROBLEMS 286
ZEEV
NUTOV
A 7/9 - APPROXIMATION ALGORITHM FOR THE MAXIMUM TRAVELING
SALESMAN
PROBLEM 298
KATARZYNA PALUCH, MARCIN MUCHA, AND ALEKSANDER MADRY
APPROXIMATION ALGORITHMS FOR DOMATIC PARTITIONS OF UNIT DISK
GRAPHS
312
SAURAV PANDIT, SRIRAM V. PEMMARAJU, AND KASTURI VARADARAJAN
ON THE COMPLEXITY OF THE ASYMMETRIC VPN PROBLEM 326
THOMAS ROTHVOSS AND LAURA SANITA
TABLE OF CONTENTS XI
CONTRIBUTED TALKS OF RANDOM
DETERMINISTIC APPROXIMATION ALGORITHMS FOR THE NEAREST CODEWORD
PROBLEM
339
NOGA ALON, RINA PANIGRAHY, AND SERGEY YEKHANIN
STRONG PARALLEL REPETITION THEOREM FOR FREE PROJECTION GAMES 352
BOAZ
BARAK, ANUP RAO, RAN RAZ, RICKY ROSEN, AND RONEN SHALTIEL
RANDOM LOW DEGREE POLYNOMIALS ARE HARD TO APPROXIMATE 366
IDO
BEN-ELIEZER, RANI HOD, AND SHACHAR LOVETT
COMPOSITION OF SEMI-LTCS BY TWO-WISE TENSOR PRODUCTS 378
ELI
BEN-SASSON AND MICHAEL VIDERMAN
ON THE SECURITY OF GOLDREICH'S ONE-WAY FUNCTION 392
ANDREJ BOGDANOV AND YOUMING QIAO
RANDOM TENSORS AND PLANTED CLIQUES 406
5.
CHARLES BRUBAKER AND SANTOSH S. VEMPALA
SAMPLING S-CONCAVE FUNCTIONS: THE LIMIT OF CONVEXITY BASED
ISOPERIMETRY
420
KARTHEKEYAN CHANDRASEKARAN, AMIT DESHPANDE, AND
SANTOSH
VEMPALA
AVERAGE-CASE ANALYSES OF VICKREY COSTS 434
PRASAD CHEBOLU, ALAN FRIEZE, PALL MELSTED. AND GREGORY B. SORKIN
A HYPERGRAPH DICTATORSHIP TEST WITH PERFECT COMPLETENESS 448
VICTOR
CHEN
EXTRACTORS USING HARDNESS AMPLIFICATION 462
ANINDYA DE AND LUCA TREVISAN
HOW WELL DO RANDOM WALKS PARALLELIZE? 476
KLIM EFREMENKO AND OMER REINGOLD
AN ANALYSIS OF RANDOM-WALK CUCKOO HASHING 490
ALAN FRIEZE, PALL MELSTED, AND MICHAEL MITZENMACHER
HIERARCHY THEOREMS FOR PROPERTY TESTING 504
ODED GOLDREICH, MICHAEL KRIVELEVICH. RAN NEWMAN, AND
EYAL
ROZENBERG
ALGORITHMIC ASPECTS OF PROPERTY TESTING IN THE DENSE GRAPHS MODEL .
520
ODED
GOLDREICH AND DANA RON
SUCCINCT REPRESENTATION OF CODES WITH APPLICATIONS TO TESTING 534
ELENA
GRIGORESCU. TALI KAUFMAN, AND MADHU SUDAN
XII TABLE OF CONTENTS
EFFICIENT QUANTUM TENSOR PRODUCT EXPANDERS AND FC-DESIGNS 548
ARAM
W. HARROW AND RICHARD A. LOW
HELLINGER STRIKES BACK: A NOTE ON THE MULTI-PARTY INFORMATION
COMPLEXITY
OF AND 562
T.S. JAYRAM
PSEUDORANDOM GENERATORS AND TYPICALLY-CORRECT DERANDOMIZATION 574
JEFF
KINNE, DIETER VAN MELKEBEEK, AND RONEN SHALTIEL
BAUM'S ALGORITHM LEARNS INTERSECTIONS OF HALFSPACES WITH RESPECT TO
LOG-CONCAVE
DISTRIBUTIONS 588
ADAM R. KLIVANS, PHILIP M. LONG, AND ALEX K. TANG
TOLERANT LINEARITY TESTING AND LOCALLY TESTABLE CODES 601
SWASTIK KOPPARTY AND SHUBHANGI SARAF
PSEUDORANDOM BIT GENERATORS THAT FOOL MODULAR SUMS 615
SHACHAR LOVETT, OMER REINGOLD, LUCA TREVISAN, AND SALII VADHAN
THE GLAUBER DYNAMICS FOR COLOURINGS OF BOUNDED DEGREE TREES 631
BRENDAN
LUDER, MICHAEL MOLLOY, AND YUVAL PERES
TESTING 1-WEIGHT HALFSPACES 646
KEVIN MATULEF RYAN O'DONNELL, RONITT RUBINFELD, AND
ROCCO
A. SERVEDIO
SMALL-BIAS SPACES FOR GROUP PRODUCTS 658
RAGHU MEKA AND DAVID ZUCKERMAN
SMALL CLIQUE DETECTION AND APPROXIMATE NASH EQUILIBRIA 673
LORENZ MINDER AND DAN VILENCHIK
TESTING COMPUTABILITY BY WIDTH TWO OBDDS 686
DANA RON AND GILAD TSUR
IMPROVED POLYNOMIAL IDENTITY TESTING FOR READ-ONCE FORMULAS 700
AMIR
SHPILKA AND ILYA VOLKOVICH
SMOOTH ANALYSIS OF THE CONDITION NUMBER AND THE LEAST SINGULAR
VALUE
714
TERENCE TAO AND VAN VU
AUTHOR INDEX
739 |
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV035681082 |
| callnumber-first | Q - Science |
| callnumber-label | QA75 |
| callnumber-raw | QA75.5 |
| callnumber-search | QA75.5 |
| callnumber-sort | QA 275.5 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SS 4800 |
| classification_tum | MAT 913f DAT 537f MAT 410f DAT 517f |
| ctrlnum | (OCoLC)436909824 (DE-599)DNB995338590 |
| dewey-full | 004.015114 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.015114 |
| dewey-search | 004.015114 |
| dewey-sort | 14.015114 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Conference Proceeding Book |
| 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">BV035681082</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20091028</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">090817s2009 xx |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">09,N31,0008</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">995338590</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642036842</subfield><subfield code="c">PB. : EUR 90.90 (freier Pr.), sfr 132.00 (freier Pr.)</subfield><subfield code="9">978-3-642-03684-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">36420636848</subfield><subfield code="9">3-642-063684-8</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642036842</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)436909824</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB995338590</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-706</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA75.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.015114</subfield><subfield code="b">I61 A12</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 913f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537f</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">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</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 ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings</subfield><subfield code="c">Irit Dinur ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 740 S.</subfield><subfield code="c">235 mm x 155 mm</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</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">5687</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximationsalgorithmus - Randomisierung - Kongress - Berkeley <Calif., 2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Kombinatorische Optimierung - Approximationsalgorithmus - Kongress - Berkeley <Calif., 2009></subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield><subfield code="x">Statistical methods</subfield><subfield code="v">Congresses</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">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="y">2009</subfield><subfield code="z">Berkeley Calif.</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" 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="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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2="1"><subfield code="a">Randomisierung</subfield><subfield code="0">(DE-588)4280827-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Dinur, Irit</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">APPROX</subfield><subfield code="n">12</subfield><subfield code="d">2009</subfield><subfield code="c">Berkeley, Calif.</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16177950-5</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">5687</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">5687</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017735347&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017735347</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2009 Berkeley Calif. gnd-content |
| genre_facet | Konferenzschrift 2009 Berkeley Calif. |
| id | DE-604.BV035681082 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-10T13:01:49Z |
| institution | BVB |
| institution_GND | (DE-588)16177950-5 |
| isbn | 9783642036842 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017735347 |
| oclc_num | 436909824 |
| open_access_boolean | |
| owner | DE-706 DE-91G DE-BY-TUM DE-83 DE-11 |
| owner_facet | DE-706 DE-91G DE-BY-TUM DE-83 DE-11 |
| physical | XII, 740 S. 235 mm x 155 mm |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| 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 ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings Irit Dinur ... (eds.) Berlin [u.a.] Springer 2009 XII, 740 S. 235 mm x 155 mm txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 5687 Approximationsalgorithmus - Randomisierung - Kongress - Berkeley <Calif., 2009> Kombinatorische Optimierung - Approximationsalgorithmus - Kongress - Berkeley <Calif., 2009> Informatik Computer algorithms Congresses Computer science Statistical methods Congresses Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Randomisierung (DE-588)4280827-3 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2009 Berkeley Calif. gnd-content Kombinatorische Optimierung (DE-588)4031826-6 s Approximationsalgorithmus (DE-588)4500954-5 s DE-604 Randomisierung (DE-588)4280827-3 s Dinur, Irit Sonstige oth APPROX 12 2009 Berkeley, Calif. Sonstige (DE-588)16177950-5 oth Lecture notes in computer science 5687 (DE-604)BV000000607 5687 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017735347&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings Lecture notes in computer science Approximationsalgorithmus - Randomisierung - Kongress - Berkeley <Calif., 2009> Kombinatorische Optimierung - Approximationsalgorithmus - Kongress - Berkeley <Calif., 2009> Informatik Computer algorithms Congresses Computer science Statistical methods Congresses Approximationsalgorithmus (DE-588)4500954-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Randomisierung (DE-588)4280827-3 gnd |
| subject_GND | (DE-588)4500954-5 (DE-588)4031826-6 (DE-588)4280827-3 (DE-588)1071861417 |
| title | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings |
| title_auth | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings |
| title_exact_search | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings |
| title_full | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings Irit Dinur ... (eds.) |
| title_fullStr | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings Irit Dinur ... (eds.) |
| title_full_unstemmed | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings Irit Dinur ... (eds.) |
| title_short | Approximation, randomization, and combinatorial optimization |
| title_sort | approximation randomization and combinatorial optimization algorithms and techniques 12th international workshop approx 2009 and 13th international workshop random 2009 berkeley ca usa august 21 23 2009 proceedings |
| title_sub | algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings |
| topic | Approximationsalgorithmus - Randomisierung - Kongress - Berkeley <Calif., 2009> Kombinatorische Optimierung - Approximationsalgorithmus - Kongress - Berkeley <Calif., 2009> Informatik Computer algorithms Congresses Computer science Statistical methods Congresses Approximationsalgorithmus (DE-588)4500954-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Randomisierung (DE-588)4280827-3 gnd |
| topic_facet | Approximationsalgorithmus - Randomisierung - Kongress - Berkeley <Calif., 2009> Kombinatorische Optimierung - Approximationsalgorithmus - Kongress - Berkeley <Calif., 2009> Informatik Computer algorithms Congresses Computer science Statistical methods Congresses Approximationsalgorithmus Kombinatorische Optimierung Randomisierung Konferenzschrift 2009 Berkeley Calif. |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017735347&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT dinuririt approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques12thinternationalworkshopapprox2009and13thinternationalworkshoprandom2009berkeleycausaaugust21232009proceedings AT approxberkeleycalif approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques12thinternationalworkshopapprox2009and13thinternationalworkshoprandom2009berkeleycausaaugust21232009proceedings |