Approximation, randomization, and combinatorial optimization - algorithms and techniques: 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011 ; proceedings
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2011
|
| Schriftenreihe: | Lecture notes in computer science
6845 |
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | XV, 702 S. graph. Darst. |
| ISBN: | 9783642229343 3642229344 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV039524485 | ||
| 003 | DE-604 | ||
| 005 | 20111115 | ||
| 007 | t| | ||
| 008 | 110811s2011 xx d||| |||| 10||| eng d | ||
| 015 | |a 11,N28 |2 dnb | ||
| 016 | 7 | |a 1013327004 |2 DE-101 | |
| 020 | |a 9783642229343 |c Pb. : ca. EUR 93.09 (DE) (freier Pr.), ca. sfr 125.00 (freier Pr.) |9 978-3-642-22934-3 | ||
| 020 | |a 3642229344 |9 3-642-22934-4 | ||
| 024 | 3 | |a 9783642229343 | |
| 028 | 5 | 2 | |a Best.-Nr.: 80083585 |
| 035 | |a (OCoLC)844944295 | ||
| 035 | |a (DE-599)DNB1013327004 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 |a DE-83 |a DE-91G | ||
| 082 | 0 | |a 511.4 |2 22/ger | |
| 082 | 0 | |a 519.640285 |2 22/ger | |
| 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 | ||
| 245 | 1 | 0 | |a Approximation, randomization, and combinatorial optimization - algorithms and techniques |b 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011 ; proceedings |c Leslie Ann Goldberg ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2011 | |
| 300 | |a XV, 702 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 6845 | |
| 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 2011 |z Princeton NJ |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 | 2 | |a Randomisierung |0 (DE-588)4280827-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Goldberg, Leslie Ann |e Sonstige |4 oth | |
| 711 | 2 | |a APPROX |n 14 |d 2011 |c Princeton, NJ |j Sonstige |0 (DE-588)16167843-9 |4 oth | |
| 711 | 2 | |a RANDOM |n 15 |d 2011 |c Princeton, NJ |j Sonstige |0 (DE-588)16167845-2 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 6845 |w (DE-604)BV000000607 |9 6845 | |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3850529&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 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=024376889&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-024376889 | |
Datensatz im Suchindex
| _version_ | 1820875338231578624 |
|---|---|
| adam_text |
IMAGE 1
TABLE OF CONTENTS
CONTRIBUTED TALKS OF APPROX NEW TOOLS FOR GRAPH COLORING 1
SANJEEV ARORA AND RONG GE
INAPPROXIMABILITY OF NP-CORAPLETE VARIANTS OF NASH EQUILIBRIUM 13 PER
AUSTRIN, MARK BRAVERMAN, AND EDEN CHLAMTAC
SPARSE RECOVERY WITH PARTIAL SUPPORT KNOWLEDGE 26
KHANH DO BA AND PIOTR TNDYK
ON CAPACITATED SET COVER PROBLEMS 38
NIKHIL BANSAL, RAVISHANKAR KRISHNASWAMY, AND BARNA SAHA
BANDWIDTH AND LOW DIMENSIONAL EMBEDDING 50
YAIR BARTAL, DOUGLAS E. CARROLL, ADAM MEYER SON, AND OF ER NEIMAN
0(1)-APPROXIMATIONS FOR MAXIMUM MOVEMENT PROBLEMS 62 PIOTR BERMAN, ERIK
D. DEMAINE, AND MORTEZA ZADIMOGHADDAM
OPTIMAL LOWER BOUNDS FOR UNIVERSAL AND DIFFERENTIALLY PRIVATE STEINER
TREES AND TSPS 75
ANAND BHALGAT, DEEPARNAB CHAKRABARTY, AND SANJEEV KHANNA
SOCIAL WELFARE IN ONE-SIDED MATCHING MARKETS WITHOUT MONEY 87 ANAND
BHALGAT, DEEPARNAB CHAKRABARTY, AND SANJEEV KHANNA
PRIMAL-DUAL SCHEMA AND LAGRANGIAN RELAXATION FOR THE FC-LOCATION-
ROUTING PROBLEM 99
TIM CARNES AND DAVID B. SHMOYS
SCHEDULING RESOURCES FOR THROUGHPUT MAXIMIZATION I LL
VENKATESAN T. CHAKARAVARTHY, AMIT KUMAR, VINAYAKA PANDIT, SAMBUDDHA ROY,
AND YOGISH SABHARWAL
COLORING AND MAXIMUM INDEPENDENT SET OF RECTANGLES 123
PARINYA CHALERMSOOK
A PRIMAL-DUAL APPROXIMATION ALGORITHM FOR MIN-SUM SINGLE-MACHINE
SCHEDULING PROBLEMS 135
MAURICE CHEUNG AND DAVID B. SHMOYS
A (1 + IN 2)-APPROXIMATION ALGORITHM FOR MINIMUM-COST
2-EDGE-CONNECTIVITY AUGMENTATION OF TREES WITH CONSTANT RADIUS 147
NACHSHON COHEN AND ZEEV NUTOV
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1013327004
DIGITALISIERT DURCH
IMAGE 2
XII TABLE OF CONTENTS
PERIODICITY AND CYCLIC SHIFTS VIA LINEAR SKETCHES 158
MICHAEL S. CROUCH AND ANDREW MCGREGOR
AN APPROXIMATION ALGORITHM FOR THE TREE I-SPANNER PROBLEM ON UNWEIGHTED
GRAPHS VIA GENERALIZED CHORDAL GRAPHS 171
FEODOR F. DRAGAN AND EKKEHARD KOEHLER
APPROXIMATING THE CLOSEST VECTOR PROBLEM USING AN APPROXIMATE SHORTEST
VECTOR ORACLE 184
CHANDAN DUBEY AND THOMAS HOLENSTEIN
OPAQUE SETS 194
ADRIAN DUMITRESCU, MINGHUI JIANG, AND JANOS PACH
EXPLORING AND TRIANGULATING A REGION BY A SWARM OF ROBOTS 206 SANDOR P.
FEKETE, TOM KAMPHANS, ALEXANDER KROELLER, JOSEPH S.B. MITCHELL, AND
CHRISTIANE SCHMIDT
IMPROVED COMPETITIVE RATIOS FOR SUBMODULAR SECRETARY PROBLEMS (EXTENDED
ABSTRACT) 218
MORAN FELDMAN, JOSEPH (SEFFI) NAOR, AND ROY SCHWARTZ
LOCATING DEPOTS FOR CAPACITATED VEHICLE ROUTING 230
INGE LI G0RTZ AND VISWANATH NAGARAJAN
SATISFYING DEGREE-D EQUATIONS OVER GF[2] N 242
JOHAN HASTAD
BLACK-BOX REDUCTIONS IN MECHANISM DESIGN 254
ZHIYI HUANG, LEI WANG, AND YUAN ZHOU
MULTIPLICATIVE APPROXIMATIONS OF RANDOM WALK TRANSITION PROBABILITIES
266
MICHAEL KAPRALOV AND RINA PANIGRAHY
APPROXIMATION SCHEMES FOR THE BETWEENNESS PROBLEM IN TOURNAMENTS AND
RELATED RANKING PROBLEMS 277
MAREK KARPINSKI AND WARREN SCHUDY
NETWORK-DESIGN WITH DEGREE CONSTRAINTS 289
ROHIT KHANDEKAR, GUY KORTSARZ, AND ZEEV NUTOV
IMPROVED APPROXIMATION ALGORITHMS FOR THE MIN-MAX TREE COVER AND BOUNDED
TREE COVER PROBLEMS 302
M. REZA KHANI AND MOHAMMAD R. SALAVATIPOUR
ALGORITHMIC EXTENSIONS OF CHEEGER'S INEQUALITY TO HIGHER EIGENVALUES AND
PARTITIONS 315
ANAND LOUIS, PRASAD RAGHAVENDRA, PRASAD TETALI, AND SANTOSH VEMPALA
IMAGE 3
TABLE OF CONTENTS XIII
NEARLY OPTIMAL NP-HARDNESS OF VERTEX COVER ON FC-UNIFORM FC-PARTITE
HYPERGRAPHS 327
SUSHANT SACHDEVA AND RISHI SAKET
A LINEAR TIME APPROXIMATION SCHEME FOR MAXIMUM QUARTET CONSISTENCY ON
SPARSE SAMPLED INPUTS 339
SAGI SNIR AND RAPHAEL YUSTER
CONTRIBUTED TALKS OF RANDOM
VIRAL PROCESSES BY RANDOM WALKS ON RANDOM REGULAR GRAPHS 351 MOHAMMED
ABDULLAH, COLIN COOPER, AND MOEZ DRAIEF
QUANTUM PROPERTY TESTING FOR BOUNDED-DEGREE GRAPHS 365
ANDRIS AMBAINIS, ANDREW M. CHILDS, AND YI-KAI LIU
LOWER BOUNDS ON THE QUERY COMPLEXITY OF NON-UNIFORM AND ADAPTIVE
REDUCTIONS SHOWING HARDNESS AMPLIFICATION 377
SERGEI ARTEMENKO AND RONEN SHALTIEL
TESTING GRAPH BLOW-UP 389
LIDOR AVIGAD AND ODED GOLDREICH
ON SUMS OF LOCALLY TESTABLE AFFINE INVARIANT PROPERTIES 400
ELI BEN-SASSON, ELENA GRIGORESCU, GHID MAATOUK, AMIR SHPILKA, AND MADHU
SUDAN
LIMITS ON THE RATE OF LOCALLY TESTABLE AFNNE-INVARIANT CODES 412 ELI
BEN-SASSON AND MADHU SUDAN
THE COMPUTATIONAL COMPLEXITY OF ESTIMATING MCMC CONVERGENCE TIME 424
NAYANTARA BHATNAGAR, ANDREJ BOGDANOV, AND ELCHANAN MOSSEL
STREAMING ALGORITHMS WITH ONE-SIDED ESTIMATION 436
JOSHUA BRODY AND DAVID P. WOODRUFF
EVERYWHERE-TIGHT INFORMATION COST TRADEOFFS FOR AUGMENTED INDEX . . .
448 AMIT CHAKRABARTI AND RANGANATH KONDAPALLY
A CANONICAL FORM FOR TESTING BOOLEAN FUNCTION PROPERTIES 460 DANA
DACHMAN-SOLED AND ROCCO A. SERVEDIO
INDEPENDENT SETS IN RANDOM GRAPHS FROM THE WEIGHTED SECOND MOMENT METHOD
472
VARSHA DANI AND CRISTOPHER MOORE
EXTRACTORS AND LOWER BOUNDS FOR LOCALLY SAMPLABLE SOURCES 483 ANINDYA DE
AND THOMAS WATSON
IMAGE 4
XIV TABLE OF CONTENTS
A DETERMINISTIC ALGORITHM FOR THE FRIEZE-KANNAN REGULARITY LEMMA . .
495 DOMINGOS DELLAMONICA, SUBRAHMANYAM KALYANASUNDARAM, DANIEL MARTIN,
VOJTECH ROEDL, AND ASAF SHAPIRA
DENSE LOCALLY TESTABLE CODES CANNOT HAVE CONSTANT RATE AND DISTANCE 507
IRIT DINUR AND TALI KAUFMAN
EFFICIENT PROBABILISTICALLY CHECKABLE DEBATES 519
ANDREW DRUCKER
AN EFFICIENT PARTITIONING ORACLE FOR BOUNDED-TREEWIDTH GRAPHS 530 ALAN
EDELMAN, AVINATAN HASSIDIM, HUY N. NGUYEN, AND KRZYSZTOF ONAK
INFLATABLE GRAPH PROPERTIES AND NATURAL PROPERTY TESTS 542
ELDAR FISCHER AND EYAL ROZENBERG
FAST SIMULATION OF LARGE-SCALE GROWTH MODELS 555
TOBIAS FRIEDRICH AND LIONEL LEVINE
IMPROVED INAPPROXIMABILITY RESULTS FOR COUNTING INDEPENDENT SETS IN THE
HARD-CORE MODEL 567
ANDREAS GALANIS, QI GE, DANIEL STEFANKOVIC, ERIC VIGODA, AND LINJI YANG
PROXIMITY OBLIVIOUS TESTING AND THE ROLE OF INVARIANCES 579 ODED
GOLDREICH AND TALI KAUFMAN
OPTIMAL RATE LIST DECODING VIA DERIVATIVE CODES 593
VENKATESAN GURUSWAMI AND CAROL WANG
PUBLIC KEY LOCALLY DECODABLE CODES WITH SHORT KEYS 605
BRETT HEMENWAY, RAFAIL OSTROVSKY, MARTIN J. STRAUSS, AND MARY WOOTTERS
ON SAMPLING FROM MULTIVARIATE DISTRIBUTIONS 616
ZHIYI HUANG AND SAMPATH KANNAN
ALMOST OPTIMAL EXPLICIT JOHNSON-LINDENSTRAUSS FAMILIES 628 DANIEL KANE,
RAGHU MEKA, AND JELANI NELSON
CORRELATION BOUNDS FOR POLY-SIZE AC 0 CIRCUITS WITH N L ~^ SYMMETRIC
GATES 640
SHACHAR LOVETT AND SRIKANTH SRINIVASAN
CLUSTERING IN INTERFERING BINARY MIXTURES 652
SARAH MIRACLE, DANA RANDALL, AND AMANDA PASCOE STREIB
IMAGE 5
TABLE OF CONTENTS XV
APPROXIMATING THE INFLUENCE OF MONOTONE BOOLEAN FUNCTIONS IN QUERY
COMPLEXITY 664
DANA RON, RONITT RUBINFELD, MULI SAFRA, AND OMRI WEINSTEIN
ON A P P R O X I M A T I NG T HE N U M B ER OF R E L E V A NT V A R I A
B L ES IN A F U N C T I ON . . . 6 76
DANA RON AND GILAD TSUR
QUERY COMPLEXITY IN ERRORLESS HARDNESS AMPLIFICATION 688
THOMAS WATSON
AUTHOR INDEX 701 |
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV039524485 |
| classification_rvk | SS 4800 |
| classification_tum | MAT 913f DAT 537f MAT 410f |
| ctrlnum | (OCoLC)844944295 (DE-599)DNB1013327004 |
| dewey-full | 511.4 519.640285 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics 519 - Probabilities and applied mathematics |
| dewey-raw | 511.4 519.640285 |
| dewey-search | 511.4 519.640285 |
| dewey-sort | 3511.4 |
| dewey-tens | 510 - Mathematics |
| 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">BV039524485</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20111115</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">110811s2011 xx d||| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">11,N28</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1013327004</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642229343</subfield><subfield code="c">Pb. : ca. EUR 93.09 (DE) (freier Pr.), ca. sfr 125.00 (freier Pr.)</subfield><subfield code="9">978-3-642-22934-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642229344</subfield><subfield code="9">3-642-22934-4</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642229343</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 80083585</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)844944295</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1013327004</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</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-83</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.4</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.640285</subfield><subfield code="2">22/ger</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="245" ind1="1" ind2="0"><subfield code="a">Approximation, randomization, and combinatorial optimization - algorithms and techniques</subfield><subfield code="b">14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011 ; proceedings</subfield><subfield code="c">Leslie Ann Goldberg ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 702 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">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">6845</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">2011</subfield><subfield code="z">Princeton NJ</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="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="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goldberg, Leslie Ann</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">14</subfield><subfield code="d">2011</subfield><subfield code="c">Princeton, NJ</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16167843-9</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">RANDOM</subfield><subfield code="n">15</subfield><subfield code="d">2011</subfield><subfield code="c">Princeton, NJ</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16167845-2</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">6845</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">6845</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3850529&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</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=024376889&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-024376889</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2011 Princeton NJ gnd-content |
| genre_facet | Konferenzschrift 2011 Princeton NJ |
| id | DE-604.BV039524485 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:14:03Z |
| institution | BVB |
| institution_GND | (DE-588)16167843-9 (DE-588)16167845-2 |
| isbn | 9783642229343 3642229344 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024376889 |
| oclc_num | 844944295 |
| open_access_boolean | |
| owner | DE-706 DE-83 DE-91G DE-BY-TUM |
| owner_facet | DE-706 DE-83 DE-91G DE-BY-TUM |
| physical | XV, 702 S. graph. Darst. |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| 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 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011 ; proceedings Leslie Ann Goldberg ... (eds.) Berlin [u.a.] Springer 2011 XV, 702 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 6845 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 2011 Princeton NJ gnd-content Kombinatorische Optimierung (DE-588)4031826-6 s Approximationsalgorithmus (DE-588)4500954-5 s Randomisierung (DE-588)4280827-3 s DE-604 Goldberg, Leslie Ann Sonstige oth APPROX 14 2011 Princeton, NJ Sonstige (DE-588)16167843-9 oth RANDOM 15 2011 Princeton, NJ Sonstige (DE-588)16167845-2 oth Lecture notes in computer science 6845 (DE-604)BV000000607 6845 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3850529&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024376889&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Approximation, randomization, and combinatorial optimization - algorithms and techniques 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011 ; proceedings Lecture notes in computer science 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 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011 ; proceedings |
| title_auth | Approximation, randomization, and combinatorial optimization - algorithms and techniques 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011 ; proceedings |
| title_exact_search | Approximation, randomization, and combinatorial optimization - algorithms and techniques 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011 ; proceedings |
| title_full | Approximation, randomization, and combinatorial optimization - algorithms and techniques 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011 ; proceedings Leslie Ann Goldberg ... (eds.) |
| title_fullStr | Approximation, randomization, and combinatorial optimization - algorithms and techniques 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011 ; proceedings Leslie Ann Goldberg ... (eds.) |
| title_full_unstemmed | Approximation, randomization, and combinatorial optimization - algorithms and techniques 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011 ; proceedings Leslie Ann Goldberg ... (eds.) |
| title_short | Approximation, randomization, and combinatorial optimization - algorithms and techniques |
| title_sort | approximation randomization and combinatorial optimization algorithms and techniques 14th international workshop approx 2011 and 15th international workshop random 2011 princeton nj usa august 17 19 2011 proceedings |
| title_sub | 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011 ; proceedings |
| topic | Approximationsalgorithmus (DE-588)4500954-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Randomisierung (DE-588)4280827-3 gnd |
| topic_facet | Approximationsalgorithmus Kombinatorische Optimierung Randomisierung Konferenzschrift 2011 Princeton NJ |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3850529&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024376889&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT goldbergleslieann approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques14thinternationalworkshopapprox2011and15thinternationalworkshoprandom2011princetonnjusaaugust17192011proceedings AT approxprincetonnj approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques14thinternationalworkshopapprox2011and15thinternationalworkshoprandom2011princetonnjusaaugust17192011proceedings AT randomprincetonnj approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques14thinternationalworkshopapprox2011and15thinternationalworkshoprandom2011princetonnjusaaugust17192011proceedings |