Approximation, randomization, and combinatorial optimization: algorithms and techniques ; 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20 - 22, 2007 ; proceedings
Gespeichert in:
| Weitere Verfasser: | |
|---|---|
| Format: | Tagungsbericht Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2007
|
| Schriftenreihe: | Lecture notes in computer science
4627 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XII, 626 S. Ill., graph. Darst. |
| ISBN: | 9783540742074 3540742077 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV022616451 | ||
| 003 | DE-604 | ||
| 005 | 20080725 | ||
| 007 | t| | ||
| 008 | 070821s2007 gw ad|| |||| 10||| eng d | ||
| 015 | |a 07,N32,0011 |2 dnb | ||
| 016 | 7 | |a 984965777 |2 DE-101 | |
| 020 | |a 9783540742074 |c Pb. : ca. EUR 77.04 (freier Pr.), ca. sfr 125.50 (freier Pr.) |9 978-3-540-74207-4 | ||
| 020 | |a 3540742077 |c Pb. : ca. EUR 77.04 (freier Pr.), ca. sfr 125.50 (freier Pr.) |9 3-540-74207-7 | ||
| 024 | 3 | |a 9783540742074 | |
| 028 | 5 | 2 | |a 12106011 |
| 035 | |a (OCoLC)164113364 | ||
| 035 | |a (DE-599)DNB984965777 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-706 |a DE-91G |a DE-824 |a DE-634 |a DE-83 |a DE-11 | ||
| 050 | 0 | |a QA75.5 | |
| 082 | 0 | |a 005.1 |2 22 | |
| 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 ; 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20 - 22, 2007 ; proceedings |c Moses Charikar ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2007 | |
| 300 | |a XII, 626 S. |b Ill., 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 4627 | |
| 650 | 7 | |a Algoritmos e estruturas de dados (congressos) |2 larpcal | |
| 650 | 7 | |a Ciência da computação (métodos estatísticos;congressos) |2 larpcal | |
| 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 2007 |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 | |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 Charikar, Moses |4 edt | |
| 711 | 2 | |a International Workshop on Approximation Algorithms for Combinatorial Optimization Problems |n 10 |d 2007 |c Princeton, NJ |j Sonstige |0 (DE-588)6066894-5 |4 oth | |
| 711 | 2 | |a International Workshop on Randomization and Computation |n 11 |d 2007 |c Princeton, NJ |j Sonstige |0 (DE-588)6066895-7 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 4627 |w (DE-604)BV000000607 |9 4627 | |
| 856 | 4 | 2 | |m KOBV Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015822584&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-015822584 | |
Datensatz im Suchindex
| _version_ | 1820875015938113536 |
|---|---|
| adam_text |
Table of Contents
Contributed Talks of APPROX
Approximation Algorithms and Hardness for Domination with
Propagation. 1
Atshkan Aazami and Michael D. Stilp
A Knapsack Secretary Problem with Applications. 16
Moshe Babaioff, Nicole Imm,orlica, David Kempe, and,
Robert Kleinberg
An Optimal Bifactor Approximation Algorithm for the Metric
Uncapacitated Facility Location Problem . 29
Jarosław Byrka
Improved Approximation Algorithms for the Spanning Star Forest
Problem. 11
Ning Chen, Roee Hngelberg, C. Thach Nguyen, Prasad Raghavendra,
At/ri Rudra, and Gyanit Singh
Packing and Covering ¿-Hyperbolic Spaces by Balls. 59
Victor Chepoi and. Bertrand, Estellon
Small Approximate Pareto Sets for Bi-objective Shortest Paths and
Other Problems. 74
Ilia,s Diakonikolas and Mihalis Yannakakis
Two Randomized Mechanisms for Combinatorial Auctions. 89
Shahar Dobzinski
Improved Approximation Ratios for Traveling Salesperson Tours and
Paths in Directed Graphs. 104
Uriel Feige and Moh.it Singh
Approximation Algorithms for the Traveling Repairman and Speeding
Deliveryman Problems with Unit-Time Windows. 119
Greg N. Frederickson and Barry Wittrnan
Stochastic Steiner Tree with Non-uniform Inflation. 134
Anupam Gupta, MohammadTaghi Hajiaghayi, and Am.it Kumar
On the Approximation Resistance of a Random Predicate. 149
Johan Hdstad.
X
Table of Contents
Integrality Gaps of Semidefinite Programs for Vertex Cover and
Relations to ti Embeddability of Negative Type Metrics. 161
Harried Hatami, Avner Mayen, and Evangelos Markakis
Optimal Resource Augmentations for Online Knapsack. 180
Kazuo Iwama and Guochuan Zhang
Soft Edge Coloring. 189
Chadi Kari- Yoo-Ah Kim, Seungjoon Lee., Alexander Russell, and
Minho Shin
Approximation Algorithms for the Max-Min Allocation Problem. 204
Subhash, Khot and Ashok Kumar Ponnuswami
Hardness of Embedding Metric Spaces of Equal Size. 218
Subhash Khot and. Rishi Saket
Coarse Differentiation and Multi-flows in Planar Graphs. 228
James R. Lee and Prasad Raghavendra
Maximum Gradient Embeddings and Monotone Clustering. 242
Manor Mendel and, Assaf Naor
Poly-logarithmic Approximation Algorithms for Directed Vehicle
R,outing Problems. 257
Viswanath Nagarajan and R. Ravi
Encouraging Cooperation in Sharing Supermodular Costs. 271
Andreas S. Schulz and Nelson A. Uhan
Almost Exact Matchings. 286
Raphael Yuster
Contributed Talks of RANDOM
On Approximating the Average Distance Between Points . 296
Kfir Darhum, Oded Goldreich, and Adi Shraibman
On Locally Dccodable Codes, Self-corrcctablc Codes, and f-Private
PIR. 311
Om,er Barkói. Yuval Ishai, and F,nav Wcinreb
A Sequential Algorithm for Generating Random Graphs. 326
Mohsen Bayati, Jeong Han Kim, and Amin Saberi
Local Limit Theorems for the Giant Component of Random
Hypergraphs. 341
Michael Bekrisch, Amin Coja-Oyhlan, and Mihyun Kang
Table of Contents
XI
Derandomization of Euclidean Random Walks. 353
Ilia Binder and Mark Braverman
High Entropy Random Selection Protocols. 366
Harry Buhrman, Matthias Christandl, Michał К опеку, Zvi Lather.
Boaz Patt-Shamir, and, Nikolai Vereshchagin
Testing st-Connectivity. 380
Sourav Chakraborty, Eldar Fischer, Oded Lachish,
Arie Matsliah, and, Пап Newman
Properly ‘2-Colouring Linear Hypergraphs. 395
Arkadev Chattopadhyay and, Bruce A. Reed,
Random Subsets of the Interval and P2P Protocols. 409
Jacek Cichoń, Marek Klonowski, Łukasz Krzywiecki,
Bartłomiej Różański, and Paweł Zieliński
The Cover Time of Random Digraphs. 422
Colin Cooper and Alan Frieze
Eigenvectors of Random Graphs: Nodal Domains . 436
Yae.l Dekel, James R. Lee, and Nathan Liniał
Lower Bounds for Swapping Arthur and Merlin. 449
Scott Diehl
Lower Bounds for Testing Forbidden Induced Substructures in
Bipartite-Graph-Like Combinatorial Objects . 464
Eldar Fischer and Eyal Rozenberg
On Estimating Frequency Moments of Data Streams. 479
Sumit Ganguly and Graham Cormode
Distribution-Free Testing Lower Bounds for Basic Boolean Functions . . 494
Dana Glasner and Rocco A. Seruedio
On the Randomness Complexity of Property Testing. 509
Oded Gold,retch and Or Sheffet,
On the Benefits of Adaptivity in Property Testing of Dense Graphs . 525
Mira Gotten and Dana Ron
Slow Mixing of Markov Chains Using Fault Lines and Fat Contours . 540
Sam Greenberg and Dana Randall,
Better Binary List-Decodable Codes Via Multilevel Concatenation. 554
Vcnkatesan Guruswami and Atri Rudra
Worst-Case to Average-Case Reductions Revisited . 569
Dan Gutfreund and Ammon Ta-Shma
XII
Table of Contents
On Finding Frequent Elements in a Data Stream. 584
Ravi Kumar and Rina Panigrahy
Implementing Huge Sparse Random Graphs. 59G
Moni Naor and Asaf Nussboim
Sublincar Algorithms for Approximating String Compressibility. 609
Sofya Raakhodnikova, Daria Ron, Ronitt Rubinfeld, and Adam Smith
Author Index
625 |
| adam_txt |
Table of Contents
Contributed Talks of APPROX
Approximation Algorithms and Hardness for Domination with
Propagation. 1
Atshkan Aazami and Michael D. Stilp
A Knapsack Secretary Problem with Applications. 16
Moshe Babaioff, Nicole Imm,orlica, David Kempe, and,
Robert Kleinberg
An Optimal Bifactor Approximation Algorithm for the Metric
Uncapacitated Facility Location Problem . 29
Jarosław Byrka
Improved Approximation Algorithms for the Spanning Star Forest
Problem. 11
Ning Chen, Roee Hngelberg, C. Thach Nguyen, Prasad Raghavendra,
At/ri Rudra, and Gyanit Singh
Packing and Covering ¿-Hyperbolic Spaces by Balls. 59
Victor Chepoi and. Bertrand, Estellon
Small Approximate Pareto Sets for Bi-objective Shortest Paths and
Other Problems. 74
Ilia,s Diakonikolas and Mihalis Yannakakis
Two Randomized Mechanisms for Combinatorial Auctions. 89
Shahar Dobzinski
Improved Approximation Ratios for Traveling Salesperson Tours and
Paths in Directed Graphs. 104
Uriel Feige and Moh.it Singh
Approximation Algorithms for the Traveling Repairman and Speeding
Deliveryman Problems with Unit-Time Windows. 119
Greg N. Frederickson and Barry Wittrnan
Stochastic Steiner Tree with Non-uniform Inflation. 134
Anupam Gupta, MohammadTaghi Hajiaghayi, and Am.it Kumar
On the Approximation Resistance of a Random Predicate. 149
Johan Hdstad.
X
Table of Contents
Integrality Gaps of Semidefinite Programs for Vertex Cover and
Relations to ti Embeddability of Negative Type Metrics. 161
Harried Hatami, Avner Mayen, and Evangelos Markakis
Optimal Resource Augmentations for Online Knapsack. 180
Kazuo Iwama and Guochuan Zhang
Soft Edge Coloring. 189
Chadi Kari- Yoo-Ah Kim, Seungjoon Lee., Alexander Russell, and
Minho Shin
Approximation Algorithms for the Max-Min Allocation Problem. 204
Subhash, Khot and Ashok Kumar Ponnuswami
Hardness of Embedding Metric Spaces of Equal Size. 218
Subhash Khot and. Rishi Saket
Coarse Differentiation and Multi-flows in Planar Graphs. 228
James R. Lee and Prasad Raghavendra
Maximum Gradient Embeddings and Monotone Clustering. 242
Manor Mendel and, Assaf Naor
Poly-logarithmic Approximation Algorithms for Directed Vehicle
R,outing Problems. 257
Viswanath Nagarajan and R. Ravi
Encouraging Cooperation in Sharing Supermodular Costs. 271
Andreas S. Schulz and Nelson A. Uhan
Almost Exact Matchings. 286
Raphael Yuster
Contributed Talks of RANDOM
On Approximating the Average Distance Between Points . 296
Kfir Darhum, Oded Goldreich, and Adi Shraibman
On Locally Dccodable Codes, Self-corrcctablc Codes, and f-Private
PIR. 311
Om,er Barkói. Yuval Ishai, and F,nav Wcinreb
A Sequential Algorithm for Generating Random Graphs. 326
Mohsen Bayati, Jeong Han Kim, and Amin Saberi
Local Limit Theorems for the Giant Component of Random
Hypergraphs. 341
Michael Bekrisch, Amin Coja-Oyhlan, and Mihyun Kang
Table of Contents
XI
Derandomization of Euclidean Random Walks. 353
Ilia Binder and Mark Braverman
High Entropy Random Selection Protocols. 366
Harry Buhrman, Matthias Christandl, Michał К опеку, Zvi Lather.
Boaz Patt-Shamir, and, Nikolai Vereshchagin
Testing st-Connectivity. 380
Sourav Chakraborty, Eldar Fischer, Oded Lachish,
Arie Matsliah, and, Пап Newman
Properly ‘2-Colouring Linear Hypergraphs. 395
Arkadev Chattopadhyay and, Bruce A. Reed,
Random Subsets of the Interval and P2P Protocols. 409
Jacek Cichoń, Marek Klonowski, Łukasz Krzywiecki,
Bartłomiej Różański, and Paweł Zieliński
The Cover Time of Random Digraphs. 422
Colin Cooper and Alan Frieze
Eigenvectors of Random Graphs: Nodal Domains . 436
Yae.l Dekel, James R. Lee, and Nathan Liniał
Lower Bounds for Swapping Arthur and Merlin. 449
Scott Diehl
Lower Bounds for Testing Forbidden Induced Substructures in
Bipartite-Graph-Like Combinatorial Objects . 464
Eldar Fischer and Eyal Rozenberg
On Estimating Frequency Moments of Data Streams. 479
Sumit Ganguly and Graham Cormode
Distribution-Free Testing Lower Bounds for Basic Boolean Functions . . 494
Dana Glasner and Rocco A. Seruedio
On the Randomness Complexity of Property Testing. 509
Oded Gold,retch and Or Sheffet,
On the Benefits of Adaptivity in Property Testing of Dense Graphs . 525
Mira Gotten and Dana Ron
Slow Mixing of Markov Chains Using Fault Lines and Fat Contours . 540
Sam Greenberg and Dana Randall,
Better Binary List-Decodable Codes Via Multilevel Concatenation. 554
Vcnkatesan Guruswami and Atri Rudra
Worst-Case to Average-Case Reductions Revisited . 569
Dan Gutfreund and Ammon Ta-Shma
XII
Table of Contents
On Finding Frequent Elements in a Data Stream. 584
Ravi Kumar and Rina Panigrahy
Implementing Huge Sparse Random Graphs. 59G
Moni Naor and Asaf Nussboim
Sublincar Algorithms for Approximating String Compressibility. 609
Sofya Raakhodnikova, Daria Ron, Ronitt Rubinfeld, and Adam Smith
Author Index
625 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author2 | Charikar, Moses |
| author2_role | edt |
| author2_variant | m c mc |
| author_facet | Charikar, Moses |
| building | Verbundindex |
| bvnumber | BV022616451 |
| 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)164113364 (DE-599)DNB984965777 |
| 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 Mathematik |
| discipline_str_mv | 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">BV022616451</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080725</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">070821s2007 gw ad|| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">07,N32,0011</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">984965777</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540742074</subfield><subfield code="c">Pb. : ca. EUR 77.04 (freier Pr.), ca. sfr 125.50 (freier Pr.)</subfield><subfield code="9">978-3-540-74207-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540742077</subfield><subfield code="c">Pb. : ca. EUR 77.04 (freier Pr.), ca. sfr 125.50 (freier Pr.)</subfield><subfield code="9">3-540-74207-7</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783540742074</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">12106011</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)164113364</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB984965777</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-634</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">005.1</subfield><subfield code="2">22</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 ; 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20 - 22, 2007 ; proceedings</subfield><subfield code="c">Moses Charikar ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 626 S.</subfield><subfield code="b">Ill., 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">4627</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmos e estruturas de dados (congressos)</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Ciência da computação (métodos estatísticos;congressos)</subfield><subfield code="2">larpcal</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">2007</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=" "><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">Charikar, Moses</subfield><subfield code="4">edt</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">International Workshop on Approximation Algorithms for Combinatorial Optimization Problems</subfield><subfield code="n">10</subfield><subfield code="d">2007</subfield><subfield code="c">Princeton, NJ</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)6066894-5</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">International Workshop on Randomization and Computation</subfield><subfield code="n">11</subfield><subfield code="d">2007</subfield><subfield code="c">Princeton, NJ</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)6066895-7</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">4627</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">4627</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">KOBV Fremddatenuebernahme</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=015822584&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-015822584</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2007 Princeton NJ gnd-content |
| genre_facet | Konferenzschrift 2007 Princeton NJ |
| id | DE-604.BV022616451 |
| illustrated | Illustrated |
| index_date | 2024-07-02T18:18:19Z |
| indexdate | 2025-01-10T15:08:56Z |
| institution | BVB |
| institution_GND | (DE-588)6066894-5 (DE-588)6066895-7 |
| isbn | 9783540742074 3540742077 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015822584 |
| oclc_num | 164113364 |
| open_access_boolean | |
| owner | DE-706 DE-91G DE-BY-TUM DE-824 DE-634 DE-83 DE-11 |
| owner_facet | DE-706 DE-91G DE-BY-TUM DE-824 DE-634 DE-83 DE-11 |
| physical | XII, 626 S. Ill., graph. Darst. |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| 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 ; 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20 - 22, 2007 ; proceedings Moses Charikar ... (eds.) Berlin [u.a.] Springer 2007 XII, 626 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 4627 Algoritmos e estruturas de dados (congressos) larpcal Ciência da computação (métodos estatísticos;congressos) larpcal 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 2007 Princeton NJ gnd-content Kombinatorische Optimierung (DE-588)4031826-6 s Approximationsalgorithmus (DE-588)4500954-5 s DE-604 Randomisierung (DE-588)4280827-3 s Charikar, Moses edt International Workshop on Approximation Algorithms for Combinatorial Optimization Problems 10 2007 Princeton, NJ Sonstige (DE-588)6066894-5 oth International Workshop on Randomization and Computation 11 2007 Princeton, NJ Sonstige (DE-588)6066895-7 oth Lecture notes in computer science 4627 (DE-604)BV000000607 4627 KOBV Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015822584&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20 - 22, 2007 ; proceedings Lecture notes in computer science Algoritmos e estruturas de dados (congressos) larpcal Ciência da computação (métodos estatísticos;congressos) larpcal 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 ; 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20 - 22, 2007 ; proceedings |
| title_auth | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20 - 22, 2007 ; proceedings |
| title_exact_search | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20 - 22, 2007 ; proceedings |
| title_exact_search_txtP | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20 - 22, 2007 ; proceedings |
| title_full | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20 - 22, 2007 ; proceedings Moses Charikar ... (eds.) |
| title_fullStr | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20 - 22, 2007 ; proceedings Moses Charikar ... (eds.) |
| title_full_unstemmed | Approximation, randomization, and combinatorial optimization algorithms and techniques ; 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20 - 22, 2007 ; proceedings Moses Charikar ... (eds.) |
| title_short | Approximation, randomization, and combinatorial optimization |
| title_sort | approximation randomization and combinatorial optimization algorithms and techniques 10th international workshop approx 2007 and 11th international workshop random 2007 princeton nj usa august 20 22 2007 proceedings |
| title_sub | algorithms and techniques ; 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20 - 22, 2007 ; proceedings |
| topic | Algoritmos e estruturas de dados (congressos) larpcal Ciência da computação (métodos estatísticos;congressos) larpcal 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 | Algoritmos e estruturas de dados (congressos) Ciência da computação (métodos estatísticos;congressos) Informatik Computer algorithms Congresses Computer science Statistical methods Congresses Approximationsalgorithmus Kombinatorische Optimierung Randomisierung Konferenzschrift 2007 Princeton NJ |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015822584&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT charikarmoses approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques10thinternationalworkshopapprox2007and11thinternationalworkshoprandom2007princetonnjusaaugust20222007proceedings AT internationalworkshoponapproximationalgorithmsforcombinatorialoptimizationproblemsprincetonnj approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques10thinternationalworkshopapprox2007and11thinternationalworkshoprandom2007princetonnjusaaugust20222007proceedings AT internationalworkshoponrandomizationandcomputationprincetonnj approximationrandomizationandcombinatorialoptimizationalgorithmsandtechniques10thinternationalworkshopapprox2007and11thinternationalworkshoprandom2007princetonnjusaaugust20222007proceedings |