Verfügbarkeit: Algorithmes d'approximation

Algorithmes d'approximation:

Gespeichert in:

Bibliographische Detailangaben
Format:	Elektronisch E-Book
Sprache:	French German English
Veröffentlicht:	Paris [u.a.] Springer 2006
Schriftenreihe:	Collection IRIS
Schlagworte:	Approximationsalgorithmus
Online-Zugang:	DE-634 DE-M347 DE-473 DE-706 DE-739 Volltext
Beschreibung:	1 Online-Ressource
ISBN:	228700677X 9782287006777 9782287310201
DOI:	10.1007/2-287-31020-7

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV023404122
003	DE-604
005	20240130
007	cr\|uuu---uuuuu
008	080718s2006 xx o\|\|\|\| 00\|\|\| fre d
016	7		\|a 966480104 \|2 DE-101
020			\|a 228700677X \|9 2-287-00677-X
020			\|a 9782287006777 \|c kart. : EUR 49,95 \|9 978-2-287-00677-7
020			\|a 9782287310201 \|c Online \|9 978-2-287-31020-1
024	7		\|a 10.1007/2-287-31020-7 \|2 doi
035			\|a (OCoLC)827073879
035			\|a (DE-599)DNB966480104
040			\|a DE-604 \|b ger
041	1		\|a fre \|a ger \|h eng
049			\|a DE-473 \|a DE-706 \|a DE-M347 \|a DE-634 \|a DE-739
082	0		\|a 004.0151
084			\|a 004 \|2 sdnb
084			\|a 510 \|2 sdnb
130	0		\|a Approximation algorithms
245	1	0	\|a Algorithmes d'approximation \|c Vijay V. Vazirani
264		1	\|a Paris [u.a.] \|b Springer \|c 2006
300			\|a 1 Online-Ressource
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
490	0		\|a Collection IRIS
650	0	7	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|2 gnd \|9 rswk-swf
689	0	0	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|D s
689	0		\|8 1\p \|5 DE-604
700	1		\|a Vazirani, Vijay V. \|d 1957- \|e Sonstige \|0 (DE-588)122932196 \|4 oth
856	4	0	\|q l \|u https://doi.org/10.1007/2-287-31020-7 \|x Verlag \|3 Volltext
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
912			\|a ZDB-2-SCS
943	1		\|a oai:aleph.bib-bvb.de:BVB01-016586847
966	e		\|u https://doi.org/10.1007/2-287-31020-7 \|l DE-634 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/2-287-31020-7 \|l DE-M347 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/2-287-31020-7 \|l DE-473 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/2-287-31020-7 \|l DE-706 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/2-287-31020-7 \|l DE-739 \|p ZDB-2-SCS \|x Verlag \|3 Volltext

Datensatz im Suchindex

_version_	1815499176029454336
adam_text
adam_txt
any_adam_object
any_adam_object_boolean
author_GND	(DE-588)122932196
building	Verbundindex
bvnumber	BV023404122
collection	ZDB-2-SCS
ctrlnum	(OCoLC)827073879 (DE-599)DNB966480104
dewey-full	004.0151
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	004 - Computer science
dewey-raw	004.0151
dewey-search	004.0151
dewey-sort	14.0151
dewey-tens	000 - Computer science, information, general works
discipline	Informatik Mathematik
discipline_str_mv	Informatik Mathematik
doi_str_mv	10.1007/2-287-31020-7
format	Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV023404122</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240130</controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">080718s2006 xx o\|\|\|\| 00\|\|\| fre d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">966480104</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">228700677X</subfield><subfield code="9">2-287-00677-X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9782287006777</subfield><subfield code="c">kart. : EUR 49,95</subfield><subfield code="9">978-2-287-00677-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9782287310201</subfield><subfield code="c">Online</subfield><subfield code="9">978-2-287-31020-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/2-287-31020-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)827073879</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB966480104</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="1" ind2=" "><subfield code="a">fre</subfield><subfield code="a">ger</subfield><subfield code="h">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</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="130" ind1="0" ind2=" "><subfield code="a">Approximation algorithms</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmes d'approximation</subfield><subfield code="c">Vijay V. Vazirani</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Paris [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</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="0" ind2=" "><subfield code="a">Collection IRIS</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="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=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vazirani, Vijay V.</subfield><subfield code="d">1957-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)122932196</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="q">l</subfield><subfield code="u">https://doi.org/10.1007/2-287-31020-7</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</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="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016586847</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/2-287-31020-7</subfield><subfield code="l">DE-634</subfield><subfield code="p">ZDB-2-SCS</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/2-287-31020-7</subfield><subfield code="l">DE-M347</subfield><subfield code="p">ZDB-2-SCS</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/2-287-31020-7</subfield><subfield code="l">DE-473</subfield><subfield code="p">ZDB-2-SCS</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/2-287-31020-7</subfield><subfield code="l">DE-706</subfield><subfield code="p">ZDB-2-SCS</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/2-287-31020-7</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection>
id	DE-604.BV023404122
illustrated	Not Illustrated
index_date	2024-07-02T21:24:50Z
indexdate	2024-11-12T07:02:15Z
institution	BVB
isbn	228700677X 9782287006777 9782287310201
language	French German English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-016586847
oclc_num	827073879
open_access_boolean
owner	DE-473 DE-BY-UBG DE-706 DE-M347 DE-634 DE-739
owner_facet	DE-473 DE-BY-UBG DE-706 DE-M347 DE-634 DE-739
physical	1 Online-Ressource
psigel	ZDB-2-SCS
publishDate	2006
publishDateSearch	2006
publishDateSort	2006
publisher	Springer
record_format	marc
series2	Collection IRIS
spelling	Approximation algorithms Algorithmes d'approximation Vijay V. Vazirani Paris [u.a.] Springer 2006 1 Online-Ressource txt rdacontent c rdamedia cr rdacarrier Collection IRIS Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 s 1\p DE-604 Vazirani, Vijay V. 1957- Sonstige (DE-588)122932196 oth l https://doi.org/10.1007/2-287-31020-7 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	Algorithmes d'approximation Approximationsalgorithmus (DE-588)4500954-5 gnd
subject_GND	(DE-588)4500954-5
title	Algorithmes d'approximation
title_alt	Approximation algorithms
title_auth	Algorithmes d'approximation
title_exact_search	Algorithmes d'approximation
title_exact_search_txtP	Algorithmes d'approximation
title_full	Algorithmes d'approximation Vijay V. Vazirani
title_fullStr	Algorithmes d'approximation Vijay V. Vazirani
title_full_unstemmed	Algorithmes d'approximation Vijay V. Vazirani
title_short	Algorithmes d'approximation
title_sort	algorithmes d approximation
topic	Approximationsalgorithmus (DE-588)4500954-5 gnd
topic_facet	Approximationsalgorithmus
url	https://doi.org/10.1007/2-287-31020-7
work_keys_str_mv	UT approximationalgorithms AT vaziranivijayv algorithmesdapproximation

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