Verfügbarkeit: The design of approximation algorithms

Gespeichert in:

Bibliographische Detailangaben
Beteiligte Personen:	Williamson, David P. 1967- (VerfasserIn), Shmoys, David Bernard 1959- (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	Cambridge Cambridge University Press [2011]
Schlagwörter:	Approximation theory Mathematical optimization COMPUTERS / Programming / Algorithms Algorithmus Entwurf Approximationsalgorithmus Optimierung
Links:	http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024164427&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
Umfang:	xi, 504 Seiten Illustrationen
ISBN:	9780521195270

Internformat

MARC


LEADER	00000nam a2200000zc 4500
001	BV039146526
003	DE-604
005	20230519
007	t\|
008	110719s2011 xxka\|\|\| \|\|\|\| 00\|\|\| eng d
010			\|a 2011001945
020			\|a 9780521195270 \|c Hardback \|9 978-0-521-19527-0
035			\|a (OCoLC)745514988
035			\|a (DE-599)BVBBV039146526
040			\|a DE-604 \|b ger \|e rda
041	0		\|a eng
044			\|a xxk \|c GB
049			\|a DE-703 \|a DE-824 \|a DE-83 \|a DE-20 \|a DE-188 \|a DE-91G \|a DE-473 \|a DE-634 \|a DE-11 \|a DE-91 \|a DE-92 \|a DE-384 \|a DE-739
050		0	\|a QA221
082	0		\|a 518/.5
084			\|a SK 905 \|0 (DE-625)143269: \|2 rvk
084			\|a ST 134 \|0 (DE-625)143590: \|2 rvk
084			\|a 68W25 \|2 msc
084			\|a DAT 530f \|2 stub
084			\|a MAT 910f \|2 stub
084			\|a 65K05 \|2 msc
084			\|a 90C59 \|2 msc
084			\|a 90C27 \|2 msc
100	1		\|a Williamson, David P. \|d 1967- \|e Verfasser \|0 (DE-588)1013297776 \|4 aut
245	1	0	\|a The design of approximation algorithms \|c David P. Williamson, David B. Shmoys
264		1	\|a Cambridge \|b Cambridge University Press \|c [2011]
264		4	\|c © 20111
300			\|a xi, 504 Seiten \|b Illustrationen
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
650		4	\|a Approximation theory
650		4	\|a Mathematical optimization
650		7	\|a COMPUTERS / Programming / Algorithms \|2 bisacsh
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Entwurf \|0 (DE-588)4121208-3 \|2 gnd \|9 rswk-swf
650	0	7	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Optimierung \|0 (DE-588)4043664-0 \|2 gnd \|9 rswk-swf
689	0	0	\|a Optimierung \|0 (DE-588)4043664-0 \|D s
689	0	1	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0	2	\|a Entwurf \|0 (DE-588)4121208-3 \|D s
689	0		\|5 DE-604
689	1	0	\|a Optimierung \|0 (DE-588)4043664-0 \|D s
689	1	1	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|D s
689	1	2	\|a Entwurf \|0 (DE-588)4121208-3 \|D s
689	1		\|8 1\p \|5 DE-604
700	1		\|a Shmoys, David Bernard \|d 1959- \|e Verfasser \|0 (DE-588)1013298829 \|4 aut
856	4		\|u http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg \|3 Cover image
856	4	2	\|m LoC Fremddatenuebernahme \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024164427&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
943	1		\|a oai:aleph.bib-bvb.de:BVB01-024164427

Datensatz im Suchindex

DE-BY-TUM_call_number	0002 DAT 530f 2016 B 83 0102 DAT 530f 2012 B 1584
DE-BY-TUM_katkey	1849412
DE-BY-TUM_location	00 01
DE-BY-TUM_media_number	040008093232 040071409942 040071408850
_version_	1823083134098341888
adam_text	THE DESIGN OF APPROXIMATION ALGORITHMS / WILLIAMSON, DAVID P. : 2011 TABLE OF CONTENTS / INHALTSVERZEICHNIS PART I. AN INTRODUCTION TO THE TECHNIQUES: 1. AN INTRODUCTION TO APPROXIMATION ALGORITHMS; 2. GREEDY ALGORITHMS AND LOCAL SEARCH; 3. ROUNDING DATA AND DYNAMIC PROGRAMMING; 4. DETERMINISTIC ROUNDING OF LINEAR PROGRAMS; 5. RANDOM SAMPLING AND RANDOMIZED ROUNDING OF LINEAR PROGRAMS; 6. RANDOMIZED ROUNDING OF SEMIDEFINITE PROGRAMS; 7. THE PRIMAL-DUAL METHOD; 8. CUTS AND METRICS; PART II. FURTHER USES OF THE TECHNIQUES: 9. FURTHER USES OF GREEDY AND LOCAL SEARCH ALGORITHMS; 10. FURTHER USES OF ROUNDING DATA AND DYNAMIC PROGRAMMING; 11. FURTHER USES OF DETERMINISTIC ROUNDING OF LINEAR PROGRAMS; 12. FURTHER USES OF RANDOM SAMPLING AND RANDOMIZED ROUNDING OF LINEAR PROGRAMS; 13. FURTHER USES OF RANDOMIZED ROUNDING OF SEMIDEFINITE PROGRAMS; 14. FURTHER USES OF THE PRIMAL-DUAL METHOD; 15. FURTHER USES OF CUTS AND METRICS; 16. TECHNIQUES IN PROVING THE HARDNESS OF APPROXIMATION; 17. OPEN PROBLEMS; APPENDIX A. LINEAR PROGRAMMING; APPENDIX B. NP-COMPLETENESS. DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
any_adam_object	1
author	Williamson, David P. 1967- Shmoys, David Bernard 1959-
author_GND	(DE-588)1013297776 (DE-588)1013298829
author_facet	Williamson, David P. 1967- Shmoys, David Bernard 1959-
author_role	aut aut
author_sort	Williamson, David P. 1967-
author_variant	d p w dp dpw d b s db dbs
building	Verbundindex
bvnumber	BV039146526
callnumber-first	Q - Science
callnumber-label	QA221
callnumber-raw	QA221
callnumber-search	QA221
callnumber-sort	QA 3221
callnumber-subject	QA - Mathematics
classification_rvk	SK 905 ST 134
classification_tum	DAT 530f MAT 910f
ctrlnum	(OCoLC)745514988 (DE-599)BVBBV039146526
dewey-full	518/.5
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	518 - Numerical analysis
dewey-raw	518/.5
dewey-search	518/.5
dewey-sort	3518 15
dewey-tens	510 - Mathematics
discipline	Informatik Mathematik
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02545nam a2200637zc 4500</leader><controlfield tag="001">BV039146526</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230519 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">110719s2011 xxka\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2011001945</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521195270</subfield><subfield code="c">Hardback</subfield><subfield code="9">978-0-521-19527-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)745514988</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV039146526</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxk</subfield><subfield code="c">GB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA221</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518/.5</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 905</subfield><subfield code="0">(DE-625)143269:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68W25</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 910f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">65K05</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90C59</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90C27</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Williamson, David P.</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1013297776</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The design of approximation algorithms</subfield><subfield code="c">David P. Williamson, David B. Shmoys</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">[2011]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 20111</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xi, 504 Seiten</subfield><subfield code="b">Illustrationen</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="650" ind1=" " ind2="4"><subfield code="a">Approximation theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Programming / Algorithms</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Entwurf</subfield><subfield code="0">(DE-588)4121208-3</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">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Entwurf</subfield><subfield code="0">(DE-588)4121208-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">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2="2"><subfield code="a">Entwurf</subfield><subfield code="0">(DE-588)4121208-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shmoys, David Bernard</subfield><subfield code="d">1959-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1013298829</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg</subfield><subfield code="3">Cover image</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">LoC 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=024164427&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024164427</subfield></datafield></record></collection>
id	DE-604.BV039146526
illustrated	Illustrated
indexdate	2024-12-20T15:51:06Z
institution	BVB
isbn	9780521195270
language	English
lccn	2011001945
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-024164427
oclc_num	745514988
open_access_boolean
owner	DE-703 DE-824 DE-83 DE-20 DE-188 DE-91G DE-BY-TUM DE-473 DE-BY-UBG DE-634 DE-11 DE-91 DE-BY-TUM DE-92 DE-384 DE-739
owner_facet	DE-703 DE-824 DE-83 DE-20 DE-188 DE-91G DE-BY-TUM DE-473 DE-BY-UBG DE-634 DE-11 DE-91 DE-BY-TUM DE-92 DE-384 DE-739
physical	xi, 504 Seiten Illustrationen
publishDate	2011
publishDateSearch	2011
publishDateSort	2011
publisher	Cambridge University Press
record_format	marc
spellingShingle	Williamson, David P. 1967- Shmoys, David Bernard 1959- The design of approximation algorithms Approximation theory Mathematical optimization COMPUTERS / Programming / Algorithms bisacsh Algorithmus (DE-588)4001183-5 gnd Entwurf (DE-588)4121208-3 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Optimierung (DE-588)4043664-0 gnd
subject_GND	(DE-588)4001183-5 (DE-588)4121208-3 (DE-588)4500954-5 (DE-588)4043664-0
title	The design of approximation algorithms
title_auth	The design of approximation algorithms
title_exact_search	The design of approximation algorithms
title_full	The design of approximation algorithms David P. Williamson, David B. Shmoys
title_fullStr	The design of approximation algorithms David P. Williamson, David B. Shmoys
title_full_unstemmed	The design of approximation algorithms David P. Williamson, David B. Shmoys
title_short	The design of approximation algorithms
title_sort	the design of approximation algorithms
topic	Approximation theory Mathematical optimization COMPUTERS / Programming / Algorithms bisacsh Algorithmus (DE-588)4001183-5 gnd Entwurf (DE-588)4121208-3 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Optimierung (DE-588)4043664-0 gnd
topic_facet	Approximation theory Mathematical optimization COMPUTERS / Programming / Algorithms Algorithmus Entwurf Approximationsalgorithmus Optimierung
url	http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024164427&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT williamsondavidp thedesignofapproximationalgorithms AT shmoysdavidbernard thedesignofapproximationalgorithms

Verfügbarkeit

Bestellen (Login erforderlich)

Inhaltsverzeichnis
Paper/Kapitel scannen lassen

Teilbibliothek Stammgelände

Bestandsangaben von Teilbibliothek Stammgelände
Signatur:	0002 DAT 530f 2016 B 83
Exemplar 1	Ausleihbar Am Standort

Teilbibliothek Mathematik & Informatik

Bestandsangaben von Teilbibliothek Mathematik & Informatik
Signatur:	0102 DAT 530f 2012 B 1584
Exemplar 1	Ausleihbar Ausgeliehen – Rückgabe bis: 03.07.2025
Exemplar 2	Ausleihbar Ausgeliehen – Rückgabe bis: 02.07.2025