Verfügbarkeit: Approximation and online algorithms

Approximation and online algorithms: 11th international workshop, WAOA 2013, Sophia Antipolis, France, September 5 - 6, 2013 ; revised selected papers

Gespeichert in:

Bibliographische Detailangaben
Format:	Elektronisch Tagungsbericht E-Book
Sprache:	English
Veröffentlicht:	Cham [u.a.] Springer 2014
Schriftenreihe:	Lecture notes in computer science 8447
Schlagworte:	Approximationsalgorithmus Online-Algorithmus Konferenzschrift > 2013 > Sophia Antipolis
Online-Zugang:	DE-634 DE-M347 DE-92 DE-859 DE-861 DE-91 DE-384 DE-473 DE-703 DE-20 DE-706 DE-29 DE-739 Volltext Inhaltsverzeichnis Abstract
Beschreibung:	1 Online-Ressource (X, 167 S.) graph. Darst.
ISBN:	9783319080017
DOI:	10.1007/978-3-319-08001-7

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV042096579
003	DE-604
007	cr\|uuu---uuuuu
008	140930s2014 xx d\|\|\| o\|\|\|\| 10\|\|\| eng d
020			\|a 9783319080017 \|c Online \|9 978-3-319-08001-7
024	7		\|a 10.1007/978-3-319-08001-7 \|2 doi
035			\|a (OCoLC)882498725
035			\|a (DE-599)BVBBV042096579
040			\|a DE-604 \|b ger \|e rakwb
041	0		\|a eng
049			\|a DE-473 \|a DE-20 \|a DE-91 \|a DE-706 \|a DE-739 \|a DE-384 \|a DE-M347 \|a DE-703 \|a DE-29 \|a DE-92 \|a DE-859 \|a DE-861 \|a DE-634
082	0		\|a 510
084			\|a MAT 652f \|2 stub
084			\|a DAT 530f \|2 stub
245	1	0	\|a Approximation and online algorithms \|b 11th international workshop, WAOA 2013, Sophia Antipolis, France, September 5 - 6, 2013 ; revised selected papers \|c Christos Kaklamanis ... (eds.)
264		1	\|a Cham [u.a.] \|b Springer \|c 2014
300			\|a 1 Online-Ressource (X, 167 S.) \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
490	1		\|a Lecture notes in computer science \|v 8447
650	0	7	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Online-Algorithmus \|0 (DE-588)4583199-3 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)1071861417 \|a Konferenzschrift \|y 2013 \|z Sophia Antipolis \|2 gnd-content
689	0	0	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|D s
689	0	1	\|a Online-Algorithmus \|0 (DE-588)4583199-3 \|D s
689	0		\|5 DE-604
700	1		\|a Kaklamanis, Christos \|e Sonstige \|0 (DE-588)1058875582 \|4 oth
711	2		\|a WAOA \|n 11. \|d 2013 \|c Sophia Antipolis \|j Sonstige \|0 (DE-588)1056942169 \|4 oth
776	0	8	\|i Erscheint auch als \|n Druckausgabe \|z 978-3-319-08000-0
830		0	\|a Lecture notes in computer science \|v 8447 \|w (DE-604)BV014880109 \|9 8447
856	4	0	\|u https://doi.org/10.1007/978-3-319-08001-7 \|x Verlag \|3 Volltext
856	4	2	\|m Springer Fremddatenuebernahme \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027537332&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
856	4	2	\|m Springer Fremddatenuebernahme \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027537332&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA \|3 Abstract
912			\|a ZDB-2-LNC
943	1		\|a oai:aleph.bib-bvb.de:BVB01-027537332
966	e		\|u https://doi.org/10.1007/978-3-319-08001-7 \|l DE-634 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-08001-7 \|l DE-M347 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-08001-7 \|l DE-92 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-08001-7 \|l DE-859 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-08001-7 \|l DE-861 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-08001-7 \|l DE-91 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-08001-7 \|l DE-384 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-08001-7 \|l DE-473 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-08001-7 \|l DE-703 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-08001-7 \|l DE-20 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-08001-7 \|l DE-706 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-08001-7 \|l DE-29 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-08001-7 \|l DE-739 \|p ZDB-2-LNC \|x Verlag \|3 Volltext

Datensatz im Suchindex

_version_	1820875618595635200
adam_text	APPROXIMATION AND ONLINE ALGORITHMS / : 2014 TABLE OF CONTENTS / INHALTSVERZEICHNIS ALGORITHMIC GAME THEORY ALGORITHMIC TRADING COLORING AND PARTITIONING COMPETITIVE ANALYSIS COMPUTATIONAL ADVERTISING COMPUTATIONAL FINANCE CUTS AND CONNECTIVITY GEOMETRIC PROBLEMS GRAPH ALGORITHMS INAPPROXIMABILITY RESULTS MECHANISM DESIGN NATURAL ALGORITHMS NETWORK DESIGN PACKING AND COVERING PARADIGMS FOR THE DESIGN AND ANALYSIS OF APPROXIMATION AND ONLINE ALGORITHMS PARAMETERIZED COMPLEXITY REAL-WORLD APPLICATIONS SCHEDULING PROBLEMS DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT. APPROXIMATION AND ONLINE ALGORITHMS / : 2014 ABSTRACT / INHALTSTEXT THIS BOOK CONSTITUTES THE THOROUGHLY REFEREED WORKSHOP PROCEEDINGS OF THE 11TH INTERNATIONAL WORKSHOP ON APPROXIMATION AND ONLINE ALGORITHMS, WAOA 2013, HELD IN SOPHIA ANTIPOLIS, FRANCE, IN SEPTEMBER 2013 AS PART OF THE ALGO 2013 CONFERENCE EVENT. THE 14 REVISED FULL PAPERS PRESENTED WERE CAREFULLY REVIEWED AND SELECTED FROM 33 SUBMISSIONS. THEY FOCUS ON THE DESIGN AND ANALYSIS OF ALGORITHMS FOR ONLINE AND COMPUTATIONALLY HARD PROBLEMS, FOR EXAMPLE IN ALGORITHMIC GAME THEORY, ALGORITHMIC TRADING, COLORING AND PARTITIONING, COMPETITIVE ANALYSIS, COMPUTATIONAL ADVERTISING, COMPUTATIONAL FINANCE, CUTS AND CONNECTIVITY, GEOMETRIC PROBLEMS, GRAPH ALGORITHMS, INAPPROXIMABILITY RESULTS, MECHANISM DESIGN, NATURAL ALGORITHMS, NETWORK DESIGN, PACKING AND COVERING, PARADIGMS FOR THE DESIGN AND ANALYSIS OF APPROXIMATION AND ONLINE ALGORITHMS, PARAMETERIZED COMPLEXITY, REAL-WORLD APPLICATIONS, SCHEDULING PROBLEMS DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
any_adam_object	1
author_GND	(DE-588)1058875582
building	Verbundindex
bvnumber	BV042096579
classification_rvk	SS 4800
classification_tum	MAT 652f DAT 530f
collection	ZDB-2-LNC
ctrlnum	(OCoLC)882498725 (DE-599)BVBBV042096579
dewey-full	510
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	510 - Mathematics
dewey-raw	510
dewey-search	510
dewey-sort	3510
dewey-tens	510 - Mathematics
discipline	Informatik Mathematik
doi_str_mv	10.1007/978-3-319-08001-7
format	Electronic Conference Proceeding eBook
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">BV042096579</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">140930s2014 xx d\|\|\| o\|\|\|\| 10\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319080017</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-319-08001-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-319-08001-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)882498725</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042096579</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 652f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximation and online algorithms</subfield><subfield code="b">11th international workshop, WAOA 2013, Sophia Antipolis, France, September 5 - 6, 2013 ; revised selected papers</subfield><subfield code="c">Christos Kaklamanis ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (X, 167 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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</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">8447</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">Online-Algorithmus</subfield><subfield code="0">(DE-588)4583199-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">2013</subfield><subfield code="z">Sophia Antipolis</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2="1"><subfield code="a">Online-Algorithmus</subfield><subfield code="0">(DE-588)4583199-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">Kaklamanis, Christos</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1058875582</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">WAOA</subfield><subfield code="n">11.</subfield><subfield code="d">2013</subfield><subfield code="c">Sophia Antipolis</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)1056942169</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-3-319-08000-0</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">8447</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">8447</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-319-08001-7</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer 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=027537332&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer 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=027537332&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Abstract</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027537332</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-08001-7</subfield><subfield code="l">DE-634</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-08001-7</subfield><subfield code="l">DE-M347</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-08001-7</subfield><subfield code="l">DE-92</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-08001-7</subfield><subfield code="l">DE-859</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-08001-7</subfield><subfield code="l">DE-861</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-08001-7</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-08001-7</subfield><subfield code="l">DE-384</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-08001-7</subfield><subfield code="l">DE-473</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-08001-7</subfield><subfield code="l">DE-703</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-08001-7</subfield><subfield code="l">DE-20</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-08001-7</subfield><subfield code="l">DE-706</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-08001-7</subfield><subfield code="l">DE-29</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-08001-7</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift 2013 Sophia Antipolis gnd-content
genre_facet	Konferenzschrift 2013 Sophia Antipolis
id	DE-604.BV042096579
illustrated	Illustrated
indexdate	2025-01-10T15:18:29Z
institution	BVB
institution_GND	(DE-588)1056942169
isbn	9783319080017
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-027537332
oclc_num	882498725
open_access_boolean
owner	DE-473 DE-BY-UBG DE-20 DE-91 DE-BY-TUM DE-706 DE-739 DE-384 DE-M347 DE-703 DE-29 DE-92 DE-859 DE-861 DE-634
owner_facet	DE-473 DE-BY-UBG DE-20 DE-91 DE-BY-TUM DE-706 DE-739 DE-384 DE-M347 DE-703 DE-29 DE-92 DE-859 DE-861 DE-634
physical	1 Online-Ressource (X, 167 S.) graph. Darst.
psigel	ZDB-2-LNC
publishDate	2014
publishDateSearch	2014
publishDateSort	2014
publisher	Springer
record_format	marc
series	Lecture notes in computer science
series2	Lecture notes in computer science
spelling	Approximation and online algorithms 11th international workshop, WAOA 2013, Sophia Antipolis, France, September 5 - 6, 2013 ; revised selected papers Christos Kaklamanis ... (eds.) Cham [u.a.] Springer 2014 1 Online-Ressource (X, 167 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 8447 Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Online-Algorithmus (DE-588)4583199-3 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2013 Sophia Antipolis gnd-content Approximationsalgorithmus (DE-588)4500954-5 s Online-Algorithmus (DE-588)4583199-3 s DE-604 Kaklamanis, Christos Sonstige (DE-588)1058875582 oth WAOA 11. 2013 Sophia Antipolis Sonstige (DE-588)1056942169 oth Erscheint auch als Druckausgabe 978-3-319-08000-0 Lecture notes in computer science 8447 (DE-604)BV014880109 8447 https://doi.org/10.1007/978-3-319-08001-7 Verlag Volltext Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027537332&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027537332&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA Abstract
spellingShingle	Approximation and online algorithms 11th international workshop, WAOA 2013, Sophia Antipolis, France, September 5 - 6, 2013 ; revised selected papers Lecture notes in computer science Approximationsalgorithmus (DE-588)4500954-5 gnd Online-Algorithmus (DE-588)4583199-3 gnd
subject_GND	(DE-588)4500954-5 (DE-588)4583199-3 (DE-588)1071861417
title	Approximation and online algorithms 11th international workshop, WAOA 2013, Sophia Antipolis, France, September 5 - 6, 2013 ; revised selected papers
title_auth	Approximation and online algorithms 11th international workshop, WAOA 2013, Sophia Antipolis, France, September 5 - 6, 2013 ; revised selected papers
title_exact_search	Approximation and online algorithms 11th international workshop, WAOA 2013, Sophia Antipolis, France, September 5 - 6, 2013 ; revised selected papers
title_full	Approximation and online algorithms 11th international workshop, WAOA 2013, Sophia Antipolis, France, September 5 - 6, 2013 ; revised selected papers Christos Kaklamanis ... (eds.)
title_fullStr	Approximation and online algorithms 11th international workshop, WAOA 2013, Sophia Antipolis, France, September 5 - 6, 2013 ; revised selected papers Christos Kaklamanis ... (eds.)
title_full_unstemmed	Approximation and online algorithms 11th international workshop, WAOA 2013, Sophia Antipolis, France, September 5 - 6, 2013 ; revised selected papers Christos Kaklamanis ... (eds.)
title_short	Approximation and online algorithms
title_sort	approximation and online algorithms 11th international workshop waoa 2013 sophia antipolis france september 5 6 2013 revised selected papers
title_sub	11th international workshop, WAOA 2013, Sophia Antipolis, France, September 5 - 6, 2013 ; revised selected papers
topic	Approximationsalgorithmus (DE-588)4500954-5 gnd Online-Algorithmus (DE-588)4583199-3 gnd
topic_facet	Approximationsalgorithmus Online-Algorithmus Konferenzschrift 2013 Sophia Antipolis
url	https://doi.org/10.1007/978-3-319-08001-7 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027537332&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027537332&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV014880109
work_keys_str_mv	AT kaklamanischristos approximationandonlinealgorithms11thinternationalworkshopwaoa2013sophiaantipolisfranceseptember562013revisedselectedpapers AT waoasophiaantipolis approximationandonlinealgorithms11thinternationalworkshopwaoa2013sophiaantipolisfranceseptember562013revisedselectedpapers

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge