Holdings: Complexity and approximation

Complexity and approximation: combinatorial optimization problems and their approximability properties

Saved in:

Bibliographic Details
Main Authors:	Ausiello, Giorgio 1941- (Author), Crescenzi, P. (Author), Gambosi, G. (Author), Kann, V. (Author), Marchetti-Spaccamela, Alberto (Author), Protasi, M. (Author)
Format:	Electronic eBook
Language:	German
Published:	Berlin ; Heidelberg Springer 1999
Subjects:	Algoritmen Combinatieleer Complexiteit Mathematische programmering Optimaliseren Combinatorial optimization Computational complexity Computer algorithms NP-vollständiges Problem Kombinatorische Optimierung Komplexitätstheorie Approximationsalgorithmus
Online Access:	UPA01 Volltext
Physical Description:	1 Online-Ressource (XIX, 524 Seiten) Illustrationen
ISBN:	9783642584121
DOI:	10.1007/978-3-642-58412-1

Staff View

MARC


LEADER	00000nmm a2200000 c 4500
001	BV047141114
003	DE-604
005	00000000000000.0
007	cr\|uuu---uuuuu
008	210215s1999 gw \|\|\|\| o\|\|u\| \|\|\|\|\|\|ger d
020			\|a 9783642584121 \|9 978-3-642-58412-1
024	7		\|a 10.1007/978-3-642-58412-1 \|2 doi
035			\|a (OCoLC)1238065801
035			\|a (DE-599)BVBBV047141114
040			\|a DE-604 \|b ger \|e rda
041	0		\|a ger
044			\|a gw \|c DE
049			\|a DE-739
050		0	\|a QA402.5
082	0		\|a 519.3 \|2 21
084			\|a ST 130 \|0 (DE-625)143588: \|2 rvk
084			\|a SK 890 \|0 (DE-625)143267: \|2 rvk
084			\|a MAT 913f \|2 stub
084			\|a DAT 517f \|2 stub
084			\|a DAT 530f \|2 stub
100	1		\|a Ausiello, Giorgio \|d 1941- \|e Verfasser \|0 (DE-588)171417178 \|4 aut
245	1	0	\|a Complexity and approximation \|b combinatorial optimization problems and their approximability properties \|c G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi
264		1	\|a Berlin ; Heidelberg \|b Springer \|c 1999
300			\|a 1 Online-Ressource (XIX, 524 Seiten) \|b Illustrationen
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
650		7	\|a Algoritmen \|2 gtt
650		7	\|a Combinatieleer \|2 gtt
650		7	\|a Complexiteit \|2 gtt
650		7	\|a Mathematische programmering \|2 gtt
650		7	\|a Optimaliseren \|2 gtt
650		4	\|a Combinatorial optimization
650		4	\|a Computational complexity
650		4	\|a Computer algorithms
650	0	7	\|a NP-vollständiges Problem \|0 (DE-588)4138229-8 \|2 gnd \|9 rswk-swf
650	0	7	\|a Kombinatorische Optimierung \|0 (DE-588)4031826-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|2 gnd \|9 rswk-swf
689	0	0	\|a Kombinatorische Optimierung \|0 (DE-588)4031826-6 \|D s
689	0	1	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|D s
689	0		\|5 DE-604
689	1	0	\|a Kombinatorische Optimierung \|0 (DE-588)4031826-6 \|D s
689	1	1	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|D s
689	1		\|5 DE-604
689	2	0	\|a NP-vollständiges Problem \|0 (DE-588)4138229-8 \|D s
689	2	1	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|D s
689	2		\|5 DE-604
700	1		\|a Crescenzi, P. \|e Verfasser \|4 aut
700	1		\|a Gambosi, G. \|e Verfasser \|4 aut
700	1		\|a Kann, V. \|e Verfasser \|4 aut
700	1		\|a Marchetti-Spaccamela, Alberto \|e Verfasser \|0 (DE-588)171425464 \|4 aut
700	1		\|a Protasi, M. \|e Verfasser \|4 aut
776	0	8	\|i Erscheint auch als \|n Druck-Ausgabe \|z 3-540-65431-3
776	0	8	\|i Erscheint auch als \|n Druck-Ausgabe \|z 978-3-642-63581-6
856	4	0	\|u https://doi.org/10.1007/978-3-642-58412-1 \|x Verlag \|z URL des Erstveröffentlichers \|3 Volltext
912			\|a ZDB-2-BAE
999			\|a oai:aleph.bib-bvb.de:BVB01-032547036
966	e		\|u https://doi.org/10.1007/978-3-642-58412-1 \|l UPA01 \|p ZDB-2-BAE \|q UPA_Einzelkauf_Springer \|x Verlag \|3 Volltext

Record in the Search Index

_version_	1804182200696963072
adam_txt
any_adam_object
any_adam_object_boolean
author	Ausiello, Giorgio 1941- Crescenzi, P. Gambosi, G. Kann, V. Marchetti-Spaccamela, Alberto Protasi, M.
author_GND	(DE-588)171417178 (DE-588)171425464
author_facet	Ausiello, Giorgio 1941- Crescenzi, P. Gambosi, G. Kann, V. Marchetti-Spaccamela, Alberto Protasi, M.
author_role	aut aut aut aut aut aut
author_sort	Ausiello, Giorgio 1941-
author_variant	g a ga p c pc g g gg v k vk a m s ams m p mp
building	Verbundindex
bvnumber	BV047141114
callnumber-first	Q - Science
callnumber-label	QA402
callnumber-raw	QA402.5
callnumber-search	QA402.5
callnumber-sort	QA 3402.5
callnumber-subject	QA - Mathematics
classification_rvk	ST 130 SK 890
classification_tum	MAT 913f DAT 517f DAT 530f
collection	ZDB-2-BAE
ctrlnum	(OCoLC)1238065801 (DE-599)BVBBV047141114
dewey-full	519.3
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	519 - Probabilities and applied mathematics
dewey-raw	519.3
dewey-search	519.3
dewey-sort	3519.3
dewey-tens	510 - Mathematics
discipline	Informatik Mathematik
discipline_str_mv	Informatik Mathematik
doi_str_mv	10.1007/978-3-642-58412-1
format	Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02925nmm a2200733 c 4500</leader><controlfield tag="001">BV047141114</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">210215s1999 gw \|\|\|\| o\|\|u\| \|\|\|\|\|\|ger d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642584121</subfield><subfield code="9">978-3-642-58412-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-58412-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1238065801</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047141114</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">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA402.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.3</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</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">MAT 913f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</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="100" ind1="1" ind2=" "><subfield code="a">Ausiello, Giorgio</subfield><subfield code="d">1941-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)171417178</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity and approximation</subfield><subfield code="b">combinatorial optimization problems and their approximability properties</subfield><subfield code="c">G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg</subfield><subfield code="b">Springer</subfield><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIX, 524 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">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="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatieleer</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexiteit</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematische programmering</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimaliseren</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</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">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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="689" ind1="0" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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">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="1"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Crescenzi, P.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gambosi, G.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kann, V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Marchetti-Spaccamela, Alberto</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)171425464</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Protasi, M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">3-540-65431-3</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-3-642-63581-6</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-58412-1</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032547036</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-58412-1</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-BAE</subfield><subfield code="q">UPA_Einzelkauf_Springer</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection>
id	DE-604.BV047141114
illustrated	Not Illustrated
index_date	2024-07-03T16:35:28Z
indexdate	2024-07-10T09:03:46Z
institution	BVB
isbn	9783642584121
language	German
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-032547036
oclc_num	1238065801
open_access_boolean
owner	DE-739
owner_facet	DE-739
physical	1 Online-Ressource (XIX, 524 Seiten) Illustrationen
psigel	ZDB-2-BAE ZDB-2-BAE UPA_Einzelkauf_Springer
publishDate	1999
publishDateSearch	1999
publishDateSort	1999
publisher	Springer
record_format	marc
spelling	Ausiello, Giorgio 1941- Verfasser (DE-588)171417178 aut Complexity and approximation combinatorial optimization problems and their approximability properties G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi Berlin ; Heidelberg Springer 1999 1 Online-Ressource (XIX, 524 Seiten) Illustrationen txt rdacontent c rdamedia cr rdacarrier Algoritmen gtt Combinatieleer gtt Complexiteit gtt Mathematische programmering gtt Optimaliseren gtt Combinatorial optimization Computational complexity Computer algorithms NP-vollständiges Problem (DE-588)4138229-8 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 s Approximationsalgorithmus (DE-588)4500954-5 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s NP-vollständiges Problem (DE-588)4138229-8 s Crescenzi, P. Verfasser aut Gambosi, G. Verfasser aut Kann, V. Verfasser aut Marchetti-Spaccamela, Alberto Verfasser (DE-588)171425464 aut Protasi, M. Verfasser aut Erscheint auch als Druck-Ausgabe 3-540-65431-3 Erscheint auch als Druck-Ausgabe 978-3-642-63581-6 https://doi.org/10.1007/978-3-642-58412-1 Verlag URL des Erstveröffentlichers Volltext
spellingShingle	Ausiello, Giorgio 1941- Crescenzi, P. Gambosi, G. Kann, V. Marchetti-Spaccamela, Alberto Protasi, M. Complexity and approximation combinatorial optimization problems and their approximability properties Algoritmen gtt Combinatieleer gtt Complexiteit gtt Mathematische programmering gtt Optimaliseren gtt Combinatorial optimization Computational complexity Computer algorithms NP-vollständiges Problem (DE-588)4138229-8 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd
subject_GND	(DE-588)4138229-8 (DE-588)4031826-6 (DE-588)4120591-1 (DE-588)4500954-5
title	Complexity and approximation combinatorial optimization problems and their approximability properties
title_auth	Complexity and approximation combinatorial optimization problems and their approximability properties
title_exact_search	Complexity and approximation combinatorial optimization problems and their approximability properties
title_exact_search_txtP	Complexity and approximation combinatorial optimization problems and their approximability properties
title_full	Complexity and approximation combinatorial optimization problems and their approximability properties G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi
title_fullStr	Complexity and approximation combinatorial optimization problems and their approximability properties G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi
title_full_unstemmed	Complexity and approximation combinatorial optimization problems and their approximability properties G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi
title_short	Complexity and approximation
title_sort	complexity and approximation combinatorial optimization problems and their approximability properties
title_sub	combinatorial optimization problems and their approximability properties
topic	Algoritmen gtt Combinatieleer gtt Complexiteit gtt Mathematische programmering gtt Optimaliseren gtt Combinatorial optimization Computational complexity Computer algorithms NP-vollständiges Problem (DE-588)4138229-8 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd
topic_facet	Algoritmen Combinatieleer Complexiteit Mathematische programmering Optimaliseren Combinatorial optimization Computational complexity Computer algorithms NP-vollständiges Problem Kombinatorische Optimierung Komplexitätstheorie Approximationsalgorithmus
url	https://doi.org/10.1007/978-3-642-58412-1
work_keys_str_mv	AT ausiellogiorgio complexityandapproximationcombinatorialoptimizationproblemsandtheirapproximabilityproperties AT crescenzip complexityandapproximationcombinatorialoptimizationproblemsandtheirapproximabilityproperties AT gambosig complexityandapproximationcombinatorialoptimizationproblemsandtheirapproximabilityproperties AT kannv complexityandapproximationcombinatorialoptimizationproblemsandtheirapproximabilityproperties AT marchettispaccamelaalberto complexityandapproximationcombinatorialoptimizationproblemsandtheirapproximabilityproperties AT protasim complexityandapproximationcombinatorialoptimizationproblemsandtheirapproximabilityproperties

Holdings

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Get full text

MARC

Record in the Search Index

There is no print copy available.

Similar Items