Holdings: Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems:

Saved in:

Bibliographic Details
Format:	Book
Language:	English
Published:	Boston [u.a.] PWS Publ. 1998
Edition:	[Nachdr.]
Subjects:	Approximationsalgorithmus Approximationstheorie Algorithmus NP-vollständiges Problem Näherungsverfahren Aufsatzsammlung
Physical Description:	XXII, 596 S. graph. Darst.
ISBN:	0534949681

Staff View

MARC


LEADER	00000nam a2200000 c 4500
001	BV012929936
003	DE-604
005	20010130
007	t
008	000110s1998 d\|\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 0534949681 \|9 0-534-94968-1
035			\|a (OCoLC)247237494
035			\|a (DE-599)BVBBV012929936
040			\|a DE-604 \|b ger \|e rakwb
041	0		\|a eng
049			\|a DE-824 \|a DE-945 \|a DE-29T \|a DE-11
050		0	\|a T57.7
082	0		\|a 511.42
084			\|a QH 422 \|0 (DE-625)141576: \|2 rvk
084			\|a SK 870 \|0 (DE-625)143265: \|2 rvk
084			\|a SK 890 \|0 (DE-625)143267: \|2 rvk
084			\|a SK 900 \|0 (DE-625)143268: \|2 rvk
084			\|a ST 600 \|0 (DE-625)143681: \|2 rvk
245	1	0	\|a Approximation algorithms for NP-hard problems \|c ed. by Dorit S. Hochbaum
250			\|a [Nachdr.]
264		1	\|a Boston [u.a.] \|b PWS Publ. \|c 1998
300			\|a XXII, 596 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
650	0	7	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Approximationstheorie \|0 (DE-588)4120913-8 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a NP-vollständiges Problem \|0 (DE-588)4138229-8 \|2 gnd \|9 rswk-swf
650	0	7	\|a Näherungsverfahren \|0 (DE-588)4206467-3 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)4143413-4 \|a Aufsatzsammlung \|2 gnd-content
689	0	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0		\|5 DE-604
689	1	0	\|a Approximationstheorie \|0 (DE-588)4120913-8 \|D s
689	1		\|5 DE-604
689	2	0	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|D s
689	2	1	\|a NP-vollständiges Problem \|0 (DE-588)4138229-8 \|D s
689	2	2	\|a Näherungsverfahren \|0 (DE-588)4206467-3 \|D s
689	2		\|8 1\p \|5 DE-604
700	1		\|a Hochbaum, Dorit S. \|e Sonstige \|0 (DE-588)121208540 \|4 oth
999			\|a oai:aleph.bib-bvb.de:BVB01-008803781
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk

Record in the Search Index

_version_	1804127620775804928
any_adam_object
author_GND	(DE-588)121208540
building	Verbundindex
bvnumber	BV012929936
callnumber-first	T - Technology
callnumber-label	T57
callnumber-raw	T57.7
callnumber-search	T57.7
callnumber-sort	T 257.7
callnumber-subject	T - General Technology
classification_rvk	QH 422 SK 870 SK 890 SK 900 ST 600
ctrlnum	(OCoLC)247237494 (DE-599)BVBBV012929936
dewey-full	511.42
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	511 - General principles of mathematics
dewey-raw	511.42
dewey-search	511.42
dewey-sort	3511.42
dewey-tens	510 - Mathematics
discipline	Informatik Mathematik Wirtschaftswissenschaften
edition	[Nachdr.]
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01944nam a2200529 c 4500</leader><controlfield tag="001">BV012929936</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20010130 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">000110s1998 d\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0534949681</subfield><subfield code="9">0-534-94968-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)247237494</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012929936</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-824</subfield><subfield code="a">DE-945</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.7</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.42</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 422</subfield><subfield code="0">(DE-625)141576:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 870</subfield><subfield code="0">(DE-625)143265:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 900</subfield><subfield code="0">(DE-625)143268:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 600</subfield><subfield code="0">(DE-625)143681:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximation algorithms for NP-hard problems</subfield><subfield code="c">ed. by Dorit S. Hochbaum</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">[Nachdr.]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">PWS Publ.</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXII, 596 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="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">Approximationstheorie</subfield><subfield code="0">(DE-588)4120913-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">NP-vollständiges Problem</subfield><subfield code="0">(DE-588)4138229-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Näherungsverfahren</subfield><subfield code="0">(DE-588)4206467-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)4143413-4</subfield><subfield code="a">Aufsatzsammlung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Approximationstheorie</subfield><subfield code="0">(DE-588)4120913-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2="1"><subfield code="a">NP-vollständiges Problem</subfield><subfield code="0">(DE-588)4138229-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">Näherungsverfahren</subfield><subfield code="0">(DE-588)4206467-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hochbaum, Dorit S.</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)121208540</subfield><subfield code="4">oth</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008803781</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></record></collection>
genre	(DE-588)4143413-4 Aufsatzsammlung gnd-content
genre_facet	Aufsatzsammlung
id	DE-604.BV012929936
illustrated	Illustrated
indexdate	2024-07-09T18:36:15Z
institution	BVB
isbn	0534949681
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-008803781
oclc_num	247237494
open_access_boolean
owner	DE-824 DE-945 DE-29T DE-11
owner_facet	DE-824 DE-945 DE-29T DE-11
physical	XXII, 596 S. graph. Darst.
publishDate	1998
publishDateSearch	1998
publishDateSort	1998
publisher	PWS Publ.
record_format	marc
spelling	Approximation algorithms for NP-hard problems ed. by Dorit S. Hochbaum [Nachdr.] Boston [u.a.] PWS Publ. 1998 XXII, 596 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Approximationstheorie (DE-588)4120913-8 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf NP-vollständiges Problem (DE-588)4138229-8 gnd rswk-swf Näherungsverfahren (DE-588)4206467-3 gnd rswk-swf (DE-588)4143413-4 Aufsatzsammlung gnd-content Algorithmus (DE-588)4001183-5 s DE-604 Approximationstheorie (DE-588)4120913-8 s Approximationsalgorithmus (DE-588)4500954-5 s NP-vollständiges Problem (DE-588)4138229-8 s Näherungsverfahren (DE-588)4206467-3 s 1\p DE-604 Hochbaum, Dorit S. Sonstige (DE-588)121208540 oth 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	Approximation algorithms for NP-hard problems Approximationsalgorithmus (DE-588)4500954-5 gnd Approximationstheorie (DE-588)4120913-8 gnd Algorithmus (DE-588)4001183-5 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Näherungsverfahren (DE-588)4206467-3 gnd
subject_GND	(DE-588)4500954-5 (DE-588)4120913-8 (DE-588)4001183-5 (DE-588)4138229-8 (DE-588)4206467-3 (DE-588)4143413-4
title	Approximation algorithms for NP-hard problems
title_auth	Approximation algorithms for NP-hard problems
title_exact_search	Approximation algorithms for NP-hard problems
title_full	Approximation algorithms for NP-hard problems ed. by Dorit S. Hochbaum
title_fullStr	Approximation algorithms for NP-hard problems ed. by Dorit S. Hochbaum
title_full_unstemmed	Approximation algorithms for NP-hard problems ed. by Dorit S. Hochbaum
title_short	Approximation algorithms for NP-hard problems
title_sort	approximation algorithms for np hard problems
topic	Approximationsalgorithmus (DE-588)4500954-5 gnd Approximationstheorie (DE-588)4120913-8 gnd Algorithmus (DE-588)4001183-5 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Näherungsverfahren (DE-588)4206467-3 gnd
topic_facet	Approximationsalgorithmus Approximationstheorie Algorithmus NP-vollständiges Problem Näherungsverfahren Aufsatzsammlung
work_keys_str_mv	AT hochbaumdorits approximationalgorithmsfornphardproblems

Holdings

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!

MARC

Record in the Search Index

There is no print copy available.

Similar Items