Eintrag weiter verarbeiten

Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers

Gespeichert in:

Personen und Körperschaften: Solis-Oba, Roberto (VerfasserIn), Persiano, Giuseppe (Sonstige)
Titel: Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers/ edited by Roberto Solis-Oba, Giuseppe Persiano
Format: E-Book Konferenzbericht
Sprache: Englisch
veröffentlicht:
Berlin, Heidelberg Springer Berlin Heidelberg 2012
Gesamtaufnahme: SpringerLink
Lecture notes in computer science ; 7164
Schlagwörter:
Buchausg. u.d.T.: Approximation and online algorithms, Berlin : Springer, 2012, X, 273 S.
Quelle: Verbunddaten SWB
Zugangsinformationen: Elektronischer Volltext - Campuslizenz
LEADER 06693cam a22012972 4500
001 0-1651398992
003 DE-627
005 20240122105116.0
007 cr uuu---uuuuu
008 120410s2012 gw |||||o 00| ||eng c
020 |a 9783642291166  |9 978-3-642-29116-6 
024 7 |a 10.1007/978-3-642-29116-6  |2 doi 
035 |a (DE-627)1651398992 
035 |a (DE-576)36341469X 
035 |a (DE-599)BSZ36341469X 
035 |a (OCoLC)785706966 
035 |a (OCoLC)785706966 
035 |a (ZBM)1241.68041 
035 |a (ZBM)1241.68041 
035 |a (DE-He213)978-3-642-29116-6 
035 |a (EBP)040541703 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
044 |c XA-DE  |c XA-DE-BE 
050 0 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
084 |a SS 4800  |q SEPA  |2 rvk  |0 (DE-625)rvk/143528: 
084 |a *68-06  |2 msc 
084 |a 68W25  |2 msc 
084 |a 68W27  |2 msc 
084 |a 00B25  |2 msc 
084 |a 54.10  |2 bkl 
084 |a 31.76  |2 bkl 
100 1 |a Solis-Oba, Roberto  |0 (DE-627)1248596188  |0 (DE-576)178596183  |4 aut 
245 1 0 |a Approximation and Online Algorithms  |b 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers  |c edited by Roberto Solis-Oba, Giuseppe Persiano 
264 1 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2012 
300 |a Online-Ressource (X, 275p. 23 illus, digital) 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
490 1 |a Lecture Notes in Computer Science  |v 7164 
490 0 |a SpringerLink  |a Bücher 
500 |a Literaturangaben 
520 |a This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications in a wide variety of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques and scheduling problems. 
650 0 |a Computer software 
650 0 |a Electronic data processing 
650 0 |a Computational complexity 
650 0 |a Computer Science 
650 0 |a Computer science 
650 0 |a Computer software 
650 0 |a Electronic data processing 
650 0 |a Computational complexity 
650 0 |a Computer graphics 
650 0 |a Algorithms 
650 0 |a Computer science 
650 0 |a Computer graphics 
650 0 |a Algorithms 
650 0 |a Numerical analysis. 
650 0 |a Discrete mathematics. 
650 0 |a Application software. 
655 7 |a Konferenzschrift  |y 2011  |z Saarbrücken  |0 (DE-588)1071861417  |0 (DE-627)826484824  |0 (DE-576)433375485  |2 gnd-content 
689 0 0 |D s  |0 (DE-588)4500954-5  |0 (DE-627)24372358X  |0 (DE-576)21308404X  |a Approximationsalgorithmus  |2 gnd 
689 0 1 |D s  |0 (DE-588)4583199-3  |0 (DE-627)325244545  |0 (DE-576)21395527X  |a Online-Algorithmus  |2 gnd 
689 0 |5 DE-101 
689 1 0 |D s  |0 (DE-588)4002498-2  |0 (DE-627)106393081  |0 (DE-576)208847391  |a Approximation  |2 gnd 
689 1 1 |D s  |0 (DE-588)4390818-4  |0 (DE-627)190206691  |0 (DE-576)211945021  |a Optimierungsproblem  |2 gnd 
689 1 |5 DE-101 
700 1 |a Persiano, Giuseppe  |4 oth 
776 1 |z 9783642291159 
776 0 8 |i Buchausg. u.d.T.  |t Approximation and online algorithms  |d Berlin : Springer, 2012  |h X, 273 S.  |w (DE-627)688617727  |w (DE-576)366043579  |z 3642291155  |z 9783642291159 
830 0 |a Lecture notes in computer science  |v 7164  |9 7164  |w (DE-627)316228877  |w (DE-576)093890923  |w (DE-600)2018930-8  |x 1611-3349  |7 ns 
856 4 0 |u https://doi.org/10.1007/978-3-642-29116-6  |m X:SPRINGER  |x Verlag  |z lizenzpflichtig  |3 Volltext 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-29116-6  |x Verlag  |3 Volltext 
856 4 2 |u https://swbplus.bsz-bw.de/bsz36341469xcov.jpg  |m V:DE-576  |m X:springer  |q image/jpeg  |v 20150922163911  |3 Cover 
856 4 2 |u https://zbmath.org/?q=an:1241.68041  |m B:ZBM  |v 2021-04-12  |x Verlag  |y Zentralblatt MATH  |3 Inhaltstext 
856 4 2 |u http://deposit.d-nb.de/cgi-bin/dokserv?id=3989302&prov=M&dok_var=1&dok_ext=htm  |m X: MVB  |q text/html  |v 2013-05-01  |x Verlag  |3 Inhaltstext 
856 4 2 |u http://d-nb.info/1020436158/04  |m B:DE-101  |q application/pdf  |v 2013-05-01  |x Verlag  |3 Inhaltsverzeichnis 
889 |w (DE-627)715040804 
912 |a ZDB-2-LNC  |b 2012 
912 |a ZDB-2-SCS  |b 2012 
912 |a ZDB-2-SEB 
912 |a ZDB-2-SXCS  |b 2012 
912 |a ZDB-2-SEB  |b 2012 
935 |h GBV  |i ExPruef 
936 r v |a SS 4800  |b Lecture notes in computer science  |k Informatik  |k Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen  |k Schriftenreihen (indiv. Sign.)  |k Lecture notes in computer science  |0 (DE-627)1271461242  |0 (DE-625)rvk/143528:  |0 (DE-576)201461242 
936 b k |a 54.10  |j Theoretische Informatik  |q SEPA  |0 (DE-627)106418815 
936 b k |a 31.76  |j Numerische Mathematik  |q SEPA  |0 (DE-627)106408194 
951 |a BO 
900 |a Oba, Roberto S.- 
950 |a Näherungsverfahren 
950 |a Approximationstheorie 
950 |a Optimierungsaufgabe 
950 |a Optimierung 
950 |a Approximation 
950 |a Algorithmus 
950 |a Approximation algorithm 
950 |a On-line algorithm 
950 |a Competitive analysis 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-29116-6  |9 DE-14 
852 |a DE-14  |x epn:3347130758  |z 2012-04-10T09:47:41Z 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-29116-6  |9 DE-15 
852 |a DE-15  |x epn:3347130790  |z 2012-04-10T09:47:41Z 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-29116-6  |9 DE-Ch1 
852 |a DE-Ch1  |x epn:3347130855  |z 2012-04-10T09:47:41Z 
976 |h Elektronischer Volltext - Campuslizenz 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-29116-6  |z Zum Online-Dokument  |9 DE-Zi4 
852 |a DE-Zi4  |x epn:3347130901  |z 2012-11-22T12:25:35Z 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-29116-6  |9 DE-520 
852 |a DE-520  |x epn:3347130987  |z 2012-04-10T09:47:41Z 
980 |a 1651398992  |b 0  |k 1651398992  |o 36341469X 
openURL url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Approximation+and+Online+Algorithms%3A+9th+International+Workshop%2C+WAOA+2011%2C+Saarbr%C3%BCcken%2C+Germany%2C+September+8-9%2C+2011%2C+Revised+Selected+Papers&rft.date=2012&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Approximation+and+Online+Algorithms%3A+9th+International+Workshop%2C+WAOA+2011%2C+Saarbr%C3%BCcken%2C+Germany%2C+September+8-9%2C+2011%2C+Revised+Selected+Papers&rft.series=Lecture+notes+in+computer+science%2C+7164&rft.au=Solis-Oba%2C+Roberto&rft.pub=Springer+Berlin+Heidelberg&rft.edition=&rft.isbn=3642291163
SOLR
_version_ 1792253778019221504
access_facet Electronic Resources
author Solis-Oba, Roberto
author2 Persiano, Giuseppe
author2_role oth
author2_variant g p gp
author_facet Solis-Oba, Roberto, Persiano, Giuseppe
author_role aut
author_sort Solis-Oba, Roberto
author_variant r s o rso
callnumber-first Q - Science
callnumber-label QA76
callnumber-raw QA76.9.A43
callnumber-search QA76.9.A43
callnumber-sort QA 276.9 A43
callnumber-subject QA - Mathematics
collection ZDB-2-LNC, ZDB-2-SCS, ZDB-2-SEB, ZDB-2-SXCS
contents This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications in a wide variety of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques and scheduling problems.
ctrlnum (DE-627)1651398992, (DE-576)36341469X, (DE-599)BSZ36341469X, (OCoLC)785706966, (ZBM)1241.68041, (DE-He213)978-3-642-29116-6, (EBP)040541703
de15_date 2012-04-10T09:47:41Z
dech1_date 2012-04-10T09:47:41Z
doi_str_mv 10.1007/978-3-642-29116-6
era_facet 2011
facet_912a ZDB-2-LNC, ZDB-2-SCS, ZDB-2-SEB, ZDB-2-SXCS
facet_avail Online
facet_local_del330 Approximationsalgorithmus, Online-Algorithmus, Approximation, Optimierungsproblem
finc_class_facet Informatik, Mathematik
fincclass_txtF_mv science-computerscience, science-mathematics
footnote Literaturangaben
format eBook, ConferenceProceedings
format_access_txtF_mv Book, E-Book
format_de105 Ebook
format_de14 Book, E-Book
format_de15 Book, E-Book
format_del152 Buch
format_detail_txtF_mv text-online-monograph-independent-conference
format_dezi4 e-Book
format_finc Book, E-Book
format_legacy ElectronicBook
format_legacy_nrw Book, E-Book
format_nrw Book, E-Book
format_strict_txtF_mv E-Book
genre Konferenzschrift 2011 Saarbrücken (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content
genre_facet Konferenzschrift
geogr_code not assigned
geogr_code_person not assigned
geographic_facet Saarbrücken
hierarchy_parent_id 0-316228877
hierarchy_parent_title Lecture notes in computer science
hierarchy_sequence 7164
hierarchy_top_id 0-316228877
hierarchy_top_title Lecture notes in computer science
id 0-1651398992
illustrated Not Illustrated
imprint Berlin, Heidelberg, Springer Berlin Heidelberg, 2012
imprint_str_mv Berlin, Heidelberg: Springer Berlin Heidelberg, 2012
institution DE-14, DE-Zi4, DE-Ch1, DE-520, DE-15
is_hierarchy_id 0-1651398992
is_hierarchy_title Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers
isbn 9783642291166
isbn_isn_mv 9783642291159, 3642291155
issn_isn_mv 1611-3349
kxp_id_str 1651398992
language English
last_indexed 2024-02-29T17:06:33.905Z
local_heading_facet_dezwi2 Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Computer graphics, Algorithms, Numerical analysis., Discrete mathematics., Application software., Approximationsalgorithmus, Online-Algorithmus, Approximation, Optimierungsproblem
marc024a_ct_mv 10.1007/978-3-642-29116-6
match_str solisoba2012approximationandonlinealgorithms9thinternationalworkshopwaoa2011saarbruckengermanyseptember892011revisedselectedpapers
mega_collection Verbunddaten SWB
multipart_link 093890923
multipart_part (093890923)7164
names_id_str_mv (DE-627)1248596188, (DE-576)178596183
oclc_num 785706966
physical Online-Ressource (X, 275p. 23 illus, digital)
publishDate 2012
publishDateSort 2012
publishPlace Berlin, Heidelberg
publisher Springer Berlin Heidelberg
record_format marcfinc
record_id 36341469X
recordtype marcfinc
rsn_id_str_mv (DE-15)3038729
rvk_facet SS 4800
rvk_label Informatik, Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen, Schriftenreihen (indiv. Sign.), Lecture notes in computer science
rvk_path SS, SQ - SU, SS 4000 - SS 5999, SS 4800
rvk_path_str_mv SS, SQ - SU, SS 4000 - SS 5999, SS 4800
series Lecture notes in computer science, 7164
series2 Lecture Notes in Computer Science ; 7164, SpringerLink ; Bücher
source_id 0
spelling Solis-Oba, Roberto (DE-627)1248596188 (DE-576)178596183 aut, Approximation and Online Algorithms 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers edited by Roberto Solis-Oba, Giuseppe Persiano, Berlin, Heidelberg Springer Berlin Heidelberg 2012, Online-Ressource (X, 275p. 23 illus, digital), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, Lecture Notes in Computer Science 7164, SpringerLink Bücher, Literaturangaben, This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications in a wide variety of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques and scheduling problems., Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Computer graphics, Algorithms, Numerical analysis., Discrete mathematics., Application software., Konferenzschrift 2011 Saarbrücken (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content, s (DE-588)4500954-5 (DE-627)24372358X (DE-576)21308404X Approximationsalgorithmus gnd, s (DE-588)4583199-3 (DE-627)325244545 (DE-576)21395527X Online-Algorithmus gnd, DE-101, s (DE-588)4002498-2 (DE-627)106393081 (DE-576)208847391 Approximation gnd, s (DE-588)4390818-4 (DE-627)190206691 (DE-576)211945021 Optimierungsproblem gnd, Persiano, Giuseppe oth, 9783642291159, Buchausg. u.d.T. Approximation and online algorithms Berlin : Springer, 2012 X, 273 S. (DE-627)688617727 (DE-576)366043579 3642291155 9783642291159, Lecture notes in computer science 7164 7164 (DE-627)316228877 (DE-576)093890923 (DE-600)2018930-8 1611-3349 ns, https://doi.org/10.1007/978-3-642-29116-6 X:SPRINGER Verlag lizenzpflichtig Volltext, http://dx.doi.org/10.1007/978-3-642-29116-6 Verlag Volltext, https://swbplus.bsz-bw.de/bsz36341469xcov.jpg V:DE-576 X:springer image/jpeg 20150922163911 Cover, https://zbmath.org/?q=an:1241.68041 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext, http://deposit.d-nb.de/cgi-bin/dokserv?id=3989302&prov=M&dok_var=1&dok_ext=htm X: MVB text/html 2013-05-01 Verlag Inhaltstext, http://d-nb.info/1020436158/04 B:DE-101 application/pdf 2013-05-01 Verlag Inhaltsverzeichnis, (DE-627)715040804, http://dx.doi.org/10.1007/978-3-642-29116-6 DE-14, DE-14 epn:3347130758 2012-04-10T09:47:41Z, http://dx.doi.org/10.1007/978-3-642-29116-6 DE-15, DE-15 epn:3347130790 2012-04-10T09:47:41Z, http://dx.doi.org/10.1007/978-3-642-29116-6 DE-Ch1, DE-Ch1 epn:3347130855 2012-04-10T09:47:41Z, http://dx.doi.org/10.1007/978-3-642-29116-6 Zum Online-Dokument DE-Zi4, DE-Zi4 epn:3347130901 2012-11-22T12:25:35Z, http://dx.doi.org/10.1007/978-3-642-29116-6 DE-520, DE-520 epn:3347130987 2012-04-10T09:47:41Z
spellingShingle Solis-Oba, Roberto, Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers, Lecture notes in computer science, 7164, This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications in a wide variety of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques and scheduling problems., Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Computer graphics, Algorithms, Numerical analysis., Discrete mathematics., Application software., Konferenzschrift 2011 Saarbrücken, Approximationsalgorithmus, Online-Algorithmus, Approximation, Optimierungsproblem
swb_id_str 36341469X
title Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers
title_auth Approximation and Online Algorithms 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers
title_full Approximation and Online Algorithms 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers edited by Roberto Solis-Oba, Giuseppe Persiano
title_fullStr Approximation and Online Algorithms 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers edited by Roberto Solis-Oba, Giuseppe Persiano
title_full_unstemmed Approximation and Online Algorithms 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers edited by Roberto Solis-Oba, Giuseppe Persiano
title_in_hierarchy 7164. Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers (2012)
title_short Approximation and Online Algorithms
title_sort approximation and online algorithms 9th international workshop waoa 2011 saarbrucken germany september 8 9 2011 revised selected papers
title_sub 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers
title_unstemmed Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers
topic Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Computer graphics, Algorithms, Numerical analysis., Discrete mathematics., Application software., Konferenzschrift 2011 Saarbrücken, Approximationsalgorithmus, Online-Algorithmus, Approximation, Optimierungsproblem
topic_facet Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Computer graphics, Algorithms, Numerical analysis., Discrete mathematics., Application software., Konferenzschrift, Approximationsalgorithmus, Online-Algorithmus, Approximation, Optimierungsproblem
url https://doi.org/10.1007/978-3-642-29116-6, http://dx.doi.org/10.1007/978-3-642-29116-6, https://swbplus.bsz-bw.de/bsz36341469xcov.jpg, https://zbmath.org/?q=an:1241.68041, http://deposit.d-nb.de/cgi-bin/dokserv?id=3989302&prov=M&dok_var=1&dok_ext=htm, http://d-nb.info/1020436158/04