Eintrag weiter verarbeiten
Online-Ressource

Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II

Gespeichert in:

Personen und Körperschaften: Berg, Mark (VerfasserIn), Meyer, Ulrich (Sonstige)
Titel: Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II/ edited by Mark Berg, Ulrich Meyer
Format: E-Book
Sprache: Englisch
veröffentlicht:
Berlin, Heidelberg Springer Berlin Heidelberg 2010
Gesamtaufnahme: SpringerLink
Lecture notes in computer science ; 6347
Schlagwörter:
Computer Communication Networks
Data structures (Computer science)
Computer software
Electronic data processing
Computational complexity
Computer Science
Computer science
Computer graphics
Computer networks .
Computer programming.
Discrete mathematics.
Algorithms.
Numerical analysis.
Buchausg. u.d.T.: Algorithms - ESA 2010 ; Part 2, Berlin : Springer, 2010, XVII, 245 S.
Quelle: Verbunddaten SWB
Zugangsinformationen: Elektronischer Volltext - Campuslizenz
LEADER 05079cam a22009132 4500
001 0-1650223064
003 DE-627
005 20240122105254.0
007 cr uuu---uuuuu
008 101005s2010 gw |||||o 00| ||eng c
020 |a 9783642157813  |9 978-3-642-15781-3 
024 7 |a 10.1007/978-3-642-15781-3  |2 doi 
035 |a (DE-627)1650223064 
035 |a (DE-576)330929534 
035 |a (DE-599)BSZ330929534 
035 |a (OCoLC)682059288 
035 |a (OCoLC)731498652 
035 |a (ZBM)1194.68068 
035 |a (DE-He213)978-3-642-15781-3 
035 |a (EBP)040526135 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
044 |c XA-DE 
050 0 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a UM  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
084 |a SS 4800  |2 rvk  |0 (DE-625)rvk/143528: 
084 |a *68-06  |2 msc 
084 |a 68Wxx  |2 msc 
084 |a 00B25  |2 msc 
100 1 |a Berg, Mark  |4 aut 
245 1 0 |a Algorithms – ESA 2010  |b 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II  |c edited by Mark Berg, Ulrich Meyer 
264 1 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2010 
300 |a Online-Ressource (XVII, 245p. 28 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 6347 
490 0 |a SpringerLink  |a Bücher 
520 |a Invited Talk -- Data Structures: Time, I/Os, Entropy, Joules! -- Session 8a -- Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness -- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games -- Combinatorial Auctions with Verification Are Tractable -- How to Allocate Goods in an Online Market? -- Session 8b -- Fréchet Distance of Surfaces: Some Simple Hard Cases -- Geometric Algorithms for Private-Cache Chip Multiprocessors -- Volume in General Metric Spaces -- Shortest Cut Graph of a Surface with Prescribed Vertex Set -- Session 9a -- Induced Matchings in Subcubic Planar Graphs -- Robust Matchings and Matroid Intersections -- A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties -- Strongly Stable Assignment -- Session 9b -- Data Structures for Storing Small Sets in the Bitprobe Model -- On Space Efficient Two Dimensional Range Minimum Data Structures -- Pairing Heaps with Costless Meld -- Top-k Ranked Document Search in General Text Databases -- Best-Paper Session -- Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time -- When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings -- Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems. 
650 0 |a Computer Communication Networks 
650 0 |a Data structures (Computer science) 
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 graphics 
650 0 |a Computer networks . 
650 0 |a Computer programming. 
650 0 |a Discrete mathematics. 
650 0 |a Algorithms. 
650 0 |a Numerical analysis. 
700 1 |a Meyer, Ulrich  |d 1971-  |0 (DE-588)124358519  |0 (DE-627)085810010  |0 (DE-576)273555510  |4 oth 
776 1 |z 9783642157806 
776 0 8 |i Buchausg. u.d.T.  |t Algorithms - ESA 2010 ; Part 2  |d Berlin : Springer, 2010  |h XVII, 245 S.  |w (DE-627)1399919059  |w (DE-576)329919059  |z 9783642157806  |z 3642157807 
830 0 |a Lecture notes in computer science  |v 6347  |9 6347  |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-15781-3  |m X:SPRINGER  |x Verlag  |z lizenzpflichtig  |3 Volltext 
856 4 2 |u https://zbmath.org/?q=an:1194.68068  |m B:ZBM  |v 2021-04-12  |x Verlag  |y Zentralblatt MATH  |3 Inhaltstext 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC  |b 2010 
912 |a ZDB-2-SEB 
912 |a ZDB-2-SCS  |b 2010 
912 |a ZDB-2-SXCS  |b 2010 
912 |a ZDB-2-SEB  |b 2010 
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 
951 |a BO 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-15781-3  |9 DE-14 
852 |a DE-14  |z 2011-07-20T14:58:54Z  |x epn:3336185424 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-15781-3  |9 DE-15 
852 |a DE-15  |z 2011-05-16T16:36:42Z  |x epn:3336185505 
976 |h Elektronischer Volltext - Campuslizenz 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-15781-3  |z Zum Online-Dokument  |9 DE-Zi4 
852 |a DE-Zi4  |z 2011-01-26T14:35:12Z  |x epn:3336185599 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-15781-3  |9 DE-520 
852 |a DE-520  |z 2010-10-05T14:42:42Z  |x epn:3336185637 
980 |a 1650223064  |b 0  |k 1650223064  |o 330929534 
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=Algorithms+%E2%80%93+ESA+2010%3A+18th+Annual+European+Symposium%2C+Liverpool%2C+UK%2C+September+6-8%2C+2010.+Proceedings%2C+Part+II&rft.date=2010&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Algorithms+%E2%80%93+ESA+2010%3A+18th+Annual+European+Symposium%2C+Liverpool%2C+UK%2C+September+6-8%2C+2010.+Proceedings%2C+Part+II&rft.series=Lecture+notes+in+computer+science%2C+6347&rft.au=Berg%2C+Mark&rft.pub=Springer+Berlin+Heidelberg&rft.edition=&rft.isbn=3642157815
SOLR
_version_ 1789362762611163136
access_facet Electronic Resources
author Berg, Mark
author2 Meyer, Ulrich
author2_role oth
author2_variant u m um
author_facet Berg, Mark, Meyer, Ulrich
author_role aut
author_sort Berg, Mark
author_variant m b mb
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-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS
contents Invited Talk -- Data Structures: Time, I/Os, Entropy, Joules! -- Session 8a -- Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness -- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games -- Combinatorial Auctions with Verification Are Tractable -- How to Allocate Goods in an Online Market? -- Session 8b -- Fréchet Distance of Surfaces: Some Simple Hard Cases -- Geometric Algorithms for Private-Cache Chip Multiprocessors -- Volume in General Metric Spaces -- Shortest Cut Graph of a Surface with Prescribed Vertex Set -- Session 9a -- Induced Matchings in Subcubic Planar Graphs -- Robust Matchings and Matroid Intersections -- A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties -- Strongly Stable Assignment -- Session 9b -- Data Structures for Storing Small Sets in the Bitprobe Model -- On Space Efficient Two Dimensional Range Minimum Data Structures -- Pairing Heaps with Costless Meld -- Top-k Ranked Document Search in General Text Databases -- Best-Paper Session -- Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time -- When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings -- Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems.
ctrlnum (DE-627)1650223064, (DE-576)330929534, (DE-599)BSZ330929534, (OCoLC)682059288, (OCoLC)731498652, (ZBM)1194.68068, (DE-He213)978-3-642-15781-3, (EBP)040526135
de15_date 2011-05-16T16:36:42Z
doi_str_mv 10.1007/978-3-642-15781-3
facet_912a ZDB-2-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS
facet_avail Online
finc_class_facet Informatik, Mathematik
finc_id_str 0001402043
fincclass_txtF_mv science-computerscience
format eBook
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
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
geogr_code not assigned
geogr_code_person not assigned
hierarchy_parent_id 0-316228877
hierarchy_parent_title Lecture notes in computer science
hierarchy_sequence 6347
hierarchy_top_id 0-316228877
hierarchy_top_title Lecture notes in computer science
id 0-1650223064
illustrated Not Illustrated
imprint Berlin, Heidelberg, Springer Berlin Heidelberg, 2010
imprint_str_mv Berlin, Heidelberg: Springer Berlin Heidelberg, 2010
institution DE-14, DE-Zi4, DE-520, DE-15
is_hierarchy_id 0-1650223064
is_hierarchy_title Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II
isbn 9783642157813
isbn_isn_mv 9783642157806, 3642157807
issn_isn_mv 1611-3349
kxp_id_str 1650223064
language English
last_indexed 2024-01-28T19:15:09.051Z
local_heading_facet_dezwi2 Computer Communication Networks, Data structures (Computer science), Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Computer graphics, Computer networks ., Computer programming., Discrete mathematics., Algorithms., Numerical analysis.
marc024a_ct_mv 10.1007/978-3-642-15781-3
match_str berg2010algorithmsesa201018thannualeuropeansymposiumliverpoolukseptember682010proceedingspartii
mega_collection Verbunddaten SWB
multipart_link 093890923
multipart_part (093890923)6347
names_id_str_mv (DE-588)124358519, (DE-627)085810010, (DE-576)273555510
oclc_num 682059288, 731498652
physical Online-Ressource (XVII, 245p. 28 illus, digital)
publishDate 2010
publishDateSort 2010
publishPlace Berlin, Heidelberg
publisher Springer Berlin Heidelberg
record_format marcfinc
record_id 330929534
recordtype marcfinc
rsn_id_str_mv (DE-15)2462024
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, 6347
series2 Lecture Notes in Computer Science ; 6347, SpringerLink ; Bücher
source_id 0
spelling Berg, Mark aut, Algorithms – ESA 2010 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II edited by Mark Berg, Ulrich Meyer, Berlin, Heidelberg Springer Berlin Heidelberg 2010, Online-Ressource (XVII, 245p. 28 illus, digital), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, Lecture Notes in Computer Science 6347, SpringerLink Bücher, Invited Talk -- Data Structures: Time, I/Os, Entropy, Joules! -- Session 8a -- Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness -- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games -- Combinatorial Auctions with Verification Are Tractable -- How to Allocate Goods in an Online Market? -- Session 8b -- Fréchet Distance of Surfaces: Some Simple Hard Cases -- Geometric Algorithms for Private-Cache Chip Multiprocessors -- Volume in General Metric Spaces -- Shortest Cut Graph of a Surface with Prescribed Vertex Set -- Session 9a -- Induced Matchings in Subcubic Planar Graphs -- Robust Matchings and Matroid Intersections -- A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties -- Strongly Stable Assignment -- Session 9b -- Data Structures for Storing Small Sets in the Bitprobe Model -- On Space Efficient Two Dimensional Range Minimum Data Structures -- Pairing Heaps with Costless Meld -- Top-k Ranked Document Search in General Text Databases -- Best-Paper Session -- Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time -- When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings -- Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems., Computer Communication Networks, Data structures (Computer science), Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Computer graphics, Computer networks ., Computer programming., Discrete mathematics., Algorithms., Numerical analysis., Meyer, Ulrich 1971- (DE-588)124358519 (DE-627)085810010 (DE-576)273555510 oth, 9783642157806, Buchausg. u.d.T. Algorithms - ESA 2010 ; Part 2 Berlin : Springer, 2010 XVII, 245 S. (DE-627)1399919059 (DE-576)329919059 9783642157806 3642157807, Lecture notes in computer science 6347 6347 (DE-627)316228877 (DE-576)093890923 (DE-600)2018930-8 1611-3349 ns, https://doi.org/10.1007/978-3-642-15781-3 X:SPRINGER Verlag lizenzpflichtig Volltext, https://zbmath.org/?q=an:1194.68068 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext, http://dx.doi.org/10.1007/978-3-642-15781-3 DE-14, DE-14 2011-07-20T14:58:54Z epn:3336185424, http://dx.doi.org/10.1007/978-3-642-15781-3 DE-15, DE-15 2011-05-16T16:36:42Z epn:3336185505, http://dx.doi.org/10.1007/978-3-642-15781-3 Zum Online-Dokument DE-Zi4, DE-Zi4 2011-01-26T14:35:12Z epn:3336185599, http://dx.doi.org/10.1007/978-3-642-15781-3 DE-520, DE-520 2010-10-05T14:42:42Z epn:3336185637
spellingShingle Berg, Mark, Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II, Lecture notes in computer science, 6347, Invited Talk -- Data Structures: Time, I/Os, Entropy, Joules! -- Session 8a -- Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness -- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games -- Combinatorial Auctions with Verification Are Tractable -- How to Allocate Goods in an Online Market? -- Session 8b -- Fréchet Distance of Surfaces: Some Simple Hard Cases -- Geometric Algorithms for Private-Cache Chip Multiprocessors -- Volume in General Metric Spaces -- Shortest Cut Graph of a Surface with Prescribed Vertex Set -- Session 9a -- Induced Matchings in Subcubic Planar Graphs -- Robust Matchings and Matroid Intersections -- A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties -- Strongly Stable Assignment -- Session 9b -- Data Structures for Storing Small Sets in the Bitprobe Model -- On Space Efficient Two Dimensional Range Minimum Data Structures -- Pairing Heaps with Costless Meld -- Top-k Ranked Document Search in General Text Databases -- Best-Paper Session -- Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time -- When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings -- Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems., Computer Communication Networks, Data structures (Computer science), Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Computer graphics, Computer networks ., Computer programming., Discrete mathematics., Algorithms., Numerical analysis.
swb_id_str 330929534
title Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II
title_auth Algorithms – ESA 2010 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II
title_full Algorithms – ESA 2010 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II edited by Mark Berg, Ulrich Meyer
title_fullStr Algorithms – ESA 2010 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II edited by Mark Berg, Ulrich Meyer
title_full_unstemmed Algorithms – ESA 2010 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II edited by Mark Berg, Ulrich Meyer
title_in_hierarchy 6347. Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II (2010)
title_short Algorithms – ESA 2010
title_sort algorithms esa 2010 18th annual european symposium liverpool uk september 6 8 2010 proceedings part ii
title_sub 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II
title_unstemmed Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II
topic Computer Communication Networks, Data structures (Computer science), Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Computer graphics, Computer networks ., Computer programming., Discrete mathematics., Algorithms., Numerical analysis.
topic_facet Computer Communication Networks, Data structures (Computer science), Computer software, Electronic data processing, Computational complexity, Computer Science, Computer science, Computer graphics, Computer networks ., Computer programming., Discrete mathematics., Algorithms., Numerical analysis.
url https://doi.org/10.1007/978-3-642-15781-3, https://zbmath.org/?q=an:1194.68068, http://dx.doi.org/10.1007/978-3-642-15781-3