Verfügbarkeit: Approximation and online algorithms

Approximation and online algorithms: 9th international workshop, WAOA 2011, Saarbrücken, Germany, September 8 - 9, 2011 ; revised selected papers

Gespeichert in:

Bibliographische Detailangaben
Format:	Tagungsbericht Buch
Sprache:	English
Veröffentlicht:	Berlin [u.a.] Springer 2012
Schriftenreihe:	Lecture notes in computer science 7164
Schlagworte:	Approximation Approximationsalgorithmus Optimierungsproblem Online-Algorithmus Konferenzschrift > 2011 > Saarbrücken
Online-Zugang:	Inhaltstext Inhaltsverzeichnis
Beschreibung:	Literaturangaben
Beschreibung:	X, 273 S. graph. Darst.
ISBN:	3642291155 9783642291159

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV040110369
003	DE-604
005	20120524
007	t\|
008	120419s2012 xx d\|\|\| \|\|\|\| 10\|\|\| eng d
015			\|a 12,N11 \|2 dnb
016	7		\|a 1020436158 \|2 DE-101
020			\|a 3642291155 \|9 3-642-29115-5
020			\|a 9783642291159 \|c Pb. : ca. EUR 49.22 (DE) (freier Pr.), ca. EUR 50.60 (AT) (freier Pr.), ca. sfr 61.50 (freier Pr.) \|9 978-3-642-29115-9
024	3		\|a 9783642291159
028	5	2	\|a Best.-Nr.: 86082013
035			\|a (OCoLC)785706966
035			\|a (DE-599)DNB1020436158
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-83 \|a DE-706 \|a DE-91G \|a DE-11
082	0		\|a 005.1 \|2 22/ger
082	0		\|a 004.0151 \|2 22/ger
084			\|a 004 \|2 sdnb
084			\|a 510 \|2 sdnb
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 Roberto Solis-Oba ... (eds.)
264		1	\|a Berlin [u.a.] \|b Springer \|c 2012
300			\|a X, 273 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 7164
500			\|a Literaturangaben
650	0	7	\|a Approximation \|0 (DE-588)4002498-2 \|2 gnd \|9 rswk-swf
650	0	7	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Optimierungsproblem \|0 (DE-588)4390818-4 \|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 2011 \|z Saarbrücken \|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
689	1	0	\|a Approximation \|0 (DE-588)4002498-2 \|D s
689	1	1	\|a Optimierungsproblem \|0 (DE-588)4390818-4 \|D s
689	1		\|5 DE-604
700	1		\|a Solis-Oba, Roberto \|e Sonstige \|4 oth
711	2		\|a WAOA \|n 9 \|d 2011 \|c Saarbrücken \|j Sonstige \|0 (DE-588)1021657026 \|4 oth
776	0	8	\|i Erscheint auch als \|n Online-Ausgabe \|z 978-3-642-29116-6
830		0	\|a Lecture notes in computer science \|v 7164 \|w (DE-604)BV000000607 \|9 7164
856	4	2	\|m X:MVB \|q text/html \|u http://deposit.dnb.de/cgi-bin/dokserv?id=3989302&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=024966716&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
943	1		\|a oai:aleph.bib-bvb.de:BVB01-024966716

Datensatz im Suchindex

_version_	1820875380741898240
adam_text	IMAGE 1 TABLE O F C O N T E N T S APPROXIMATION ALGORITHMS FOR SCHEDULING AND PACKING PROBLEMS 1 KLAUS J A N S E N APPROXIMATING SUBSET FC-CONNECTIVITY PROBLEMS 9 ZEEV N U T O V LEARNING IN STOCHASTIC MACHINE SCHEDULING 21 SEBASTIAN MARBDN, CYRIEL RUTTEN. ARID TJARK VREDEVELD AN ONLINE ALGORITHM OPTIMALLY SELF-TUNING TO CONGESTION FOR POWER MANAGEMENT PROBLEMS 35 WOLFGANG BEIN. NAOKI HATTA, NELSON HERNANDEZ-CONS, HIRO ITO, SHOJI KASAHARA. AND J U N KAWAHARA SINGLE APPROXIMATION FOR BIOBJECTIVE MAX T S P 49 CRISTINA BAZGAN. LAURENT GOURVES. JEROME MONNOT, AND FANNY PASCUAL PARAMETERIZED APPROXIMATION ALGORITHMS FOR H I T T I N G S E T 6 3 LJILJANA BRANKOVIC AND HENNING FERNAU APPROXIMATION ALGORITHMS FOR THE MAXIMUM LEAF SPANNING TREE PROBLEM ON ACYCLIC DIGRAPHS 77 NADINE SCHWARTGES, JOACHIM SPOERHASE, AND ALEXANDER WOLFF OPTIMIZATION OVER INTEGERS WITH ROBUSTNESS IN COST AND FEW CONSTRAINTS 89 KAI-SIMON GOETZMANN, SEBASTIAN STILLER, AND CLAUDIO TELHA A LOWER BOUND ON DETERMINISTIC ONLINE ALGORITHMS FOR SCHEDULING ON RELATED MACHINES WITHOUT PREEMPTION 102 TORRIDS EBENLENDR AND J I N SGALL SCHEDULING JOBS ON IDENTICAL AND UNIFORM PROCESSORS REVISITED 109 KLAUS JANSEN AND CHRISTINA ROBENEK APPROXIMATION ALGORITHMS FOR FRAGMENTING A GRAPH AGAINST A STOCHASTICALLY-LOCATED THREAT 123 DAVID B. SHMOYS AND GWEN SPENCER NON-CLAIRVOYANT WEIGHTED FLOW TIME SCHEDULING ON DIFFERENT MULTI-PROCESSOR MODELS 137 JIANQIAO ZHU. HO-LEUNG CHAN, AND TAK- WAH L A M HTTP://D-NB.INFO/1020436158 IMAGE 2 X TABLE OF CONTENTS A NEW PERSPECTIVE ON LIST UPDATE: PROBABILISTIC LOCALITY AND WORKING SET 150 REZA DORRIGIV AND ALEJANDRO LOPEZ-ORTIZ ONLINEMLN: A FAST STRONGLY COMPETITIVE RANDOMIZED PAGING ALGORITHM 164 GERTH ST0LTINY BRODAL, GABRIEL MORUZ, AND ANDREI NEGOESCU FASTER AND SIMPLER APPROXIMATION OF STABLE MATCHINGS 176 KATARZYNA PALUCH SIMPLER 3/4-APPROXIMATION ALGORITHMS FOR MAX SAT 188 A N K E VAN ZUYLEN ON ONLINE ALGORITHMS WITH ADVICE FOR THE FC-SERVER PROBLEM 198 MARC P. RENAULT AND A D I R O S E N IMPROVED LOWER BOUND FOR ONLINE STRIP PACKING (EXTENDED ABSTRACT) 211 R O L F HARREN AND WALTER K E R N COMPETITIVE ROUTER SCHEDULING WITH STRUCTURED D A T A 219 YISHAY MANSOUR, BOAZ PATT-SHAMIR, AND DROR RAWITZ APPROXIMATION WITH A FIXED NUMBER OF SOLUTIONS OF SOME BIOBJECTIVE MAXIMIZATION PROBLEMS 233 CRISTINA BAZGAN, LAXIRENT GOURVES, AND JEROME M O N N O T GENERALIZED MAXIMUM FLOWS OVER TIME 247 MARTIN GROFI AND M A R T I N SKUTELLA THE PRICE OF ANARCHY FOR MINSUM RELATED MACHINE SCHEDULING 261 RUBEN HOEKSMA AND MARC UETZ A U T H O R I N D E X 275
any_adam_object	1
building	Verbundindex
bvnumber	BV040110369
classification_rvk	SS 4800
ctrlnum	(OCoLC)785706966 (DE-599)DNB1020436158
dewey-full	005.1 004.0151
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	005 - Computer programming, programs, data, security 004 - Computer science
dewey-raw	005.1 004.0151
dewey-search	005.1 004.0151
dewey-sort	15.1
dewey-tens	000 - Computer science, information, general works
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">BV040110369</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120524</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">120419s2012 xx d\|\|\| \|\|\|\| 10\|\|\| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">12,N11</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1020436158</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642291155</subfield><subfield code="9">3-642-29115-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642291159</subfield><subfield code="c">Pb. : ca. EUR 49.22 (DE) (freier Pr.), ca. EUR 50.60 (AT) (freier Pr.), ca. sfr 61.50 (freier Pr.)</subfield><subfield code="9">978-3-642-29115-9</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642291159</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 86082013</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)785706966</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1020436158</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-83</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">22/ger</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">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximation and online algorithms</subfield><subfield code="b">9th international workshop, WAOA 2011, Saarbrücken, Germany, September 8 - 9, 2011 ; revised selected papers</subfield><subfield code="c">Roberto Solis-Oba ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 273 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">7164</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</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">2011</subfield><subfield code="z">Saarbrücken</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="689" ind1="1" ind2="0"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</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">Solis-Oba, Roberto</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">WAOA</subfield><subfield code="n">9</subfield><subfield code="d">2011</subfield><subfield code="c">Saarbrücken</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)1021657026</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-642-29116-6</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7164</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">7164</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=3989302&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=024966716&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-024966716</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift 2011 Saarbrücken gnd-content
genre_facet	Konferenzschrift 2011 Saarbrücken
id	DE-604.BV040110369
illustrated	Illustrated
indexdate	2025-01-10T15:14:43Z
institution	BVB
institution_GND	(DE-588)1021657026
isbn	3642291155 9783642291159
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-024966716
oclc_num	785706966
open_access_boolean
owner	DE-83 DE-706 DE-91G DE-BY-TUM DE-11
owner_facet	DE-83 DE-706 DE-91G DE-BY-TUM DE-11
physical	X, 273 S. graph. Darst.
publishDate	2012
publishDateSearch	2012
publishDateSort	2012
publisher	Springer
record_format	marc
series	Lecture notes in computer science
series2	Lecture notes in computer science
spelling	Approximation and online algorithms 9th international workshop, WAOA 2011, Saarbrücken, Germany, September 8 - 9, 2011 ; revised selected papers Roberto Solis-Oba ... (eds.) Berlin [u.a.] Springer 2012 X, 273 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 7164 Literaturangaben Approximation (DE-588)4002498-2 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Optimierungsproblem (DE-588)4390818-4 gnd rswk-swf Online-Algorithmus (DE-588)4583199-3 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2011 Saarbrücken gnd-content Approximationsalgorithmus (DE-588)4500954-5 s Online-Algorithmus (DE-588)4583199-3 s DE-604 Approximation (DE-588)4002498-2 s Optimierungsproblem (DE-588)4390818-4 s Solis-Oba, Roberto Sonstige oth WAOA 9 2011 Saarbrücken Sonstige (DE-588)1021657026 oth Erscheint auch als Online-Ausgabe 978-3-642-29116-6 Lecture notes in computer science 7164 (DE-604)BV000000607 7164 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3989302&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=024966716&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Approximation and online algorithms 9th international workshop, WAOA 2011, Saarbrücken, Germany, September 8 - 9, 2011 ; revised selected papers Lecture notes in computer science Approximation (DE-588)4002498-2 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Optimierungsproblem (DE-588)4390818-4 gnd Online-Algorithmus (DE-588)4583199-3 gnd
subject_GND	(DE-588)4002498-2 (DE-588)4500954-5 (DE-588)4390818-4 (DE-588)4583199-3 (DE-588)1071861417
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_exact_search	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 Roberto Solis-Oba ... (eds.)
title_fullStr	Approximation and online algorithms 9th international workshop, WAOA 2011, Saarbrücken, Germany, September 8 - 9, 2011 ; revised selected papers Roberto Solis-Oba ... (eds.)
title_full_unstemmed	Approximation and online algorithms 9th international workshop, WAOA 2011, Saarbrücken, Germany, September 8 - 9, 2011 ; revised selected papers Roberto Solis-Oba ... (eds.)
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
topic	Approximation (DE-588)4002498-2 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Optimierungsproblem (DE-588)4390818-4 gnd Online-Algorithmus (DE-588)4583199-3 gnd
topic_facet	Approximation Approximationsalgorithmus Optimierungsproblem Online-Algorithmus Konferenzschrift 2011 Saarbrücken
url	http://deposit.dnb.de/cgi-bin/dokserv?id=3989302&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=024966716&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV000000607
work_keys_str_mv	AT solisobaroberto approximationandonlinealgorithms9thinternationalworkshopwaoa2011saarbruckengermanyseptember892011revisedselectedpapers AT waoasaarbrucken approximationandonlinealgorithms9thinternationalworkshopwaoa2011saarbruckengermanyseptember892011revisedselectedpapers

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Beschreibung

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge