Complexity and approximation: combinatorial optimization problems and their approximability properties Buch
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1999
|
| Schlagworte: | |
| Beschreibung: | XIX, 524 S. graph. Darst. |
| ISBN: | 3540654313 |
Internformat
MARC
| LEADER | 00000nam a2200000 cc4500 | ||
|---|---|---|---|
| 001 | BV026998020 | ||
| 003 | DE-604 | ||
| 005 | 20110228 | ||
| 007 | t | ||
| 008 | 110326s1999 d||| |||| 00||| eng d | ||
| 020 | |a 3540654313 |9 3-540-65431-3 | ||
| 035 | |a (OCoLC)917301316 | ||
| 035 | |a (DE-599)BVBBV026998020 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-188 | ||
| 100 | 1 | |a Ausiello, Giorgio |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Complexity and approximation |b combinatorial optimization problems and their approximability properties |n Buch |c G. Ausiello ... |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1999 | |
| 300 | |a XIX, 524 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 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 Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 0 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a NP-vollständiges Problem |0 (DE-588)4138229-8 |D s |
| 689 | 1 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 2 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 2 | |5 DE-604 | |
| 773 | 0 | 8 | |w (DE-604)BV026365153 |g Buch |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-021341554 | ||
Datensatz im Suchindex
| _version_ | 1804144067112599552 |
|---|---|
| any_adam_object | |
| author | Ausiello, Giorgio |
| author_facet | Ausiello, Giorgio |
| author_role | aut |
| author_sort | Ausiello, Giorgio |
| author_variant | g a ga |
| building | Verbundindex |
| bvnumber | BV026998020 |
| ctrlnum | (OCoLC)917301316 (DE-599)BVBBV026998020 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01577nam a2200421 cc4500</leader><controlfield tag="001">BV026998020</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110228 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">110326s1999 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540654313</subfield><subfield code="9">3-540-65431-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)917301316</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV026998020</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-188</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ausiello, Giorgio</subfield><subfield code="e">Verfasser</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="n">Buch</subfield><subfield code="c">G. Ausiello ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIX, 524 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">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">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">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="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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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">NP-vollständiges Problem</subfield><subfield code="0">(DE-588)4138229-8</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="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="773" ind1="0" ind2="8"><subfield code="w">(DE-604)BV026365153</subfield><subfield code="g">Buch</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-021341554</subfield></datafield></record></collection> |
| id | DE-604.BV026998020 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:57:39Z |
| institution | BVB |
| isbn | 3540654313 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-021341554 |
| oclc_num | 917301316 |
| open_access_boolean | |
| owner | DE-188 |
| owner_facet | DE-188 |
| physical | XIX, 524 S. graph. Darst. |
| publishDate | 1999 |
| publishDateSearch | 1999 |
| publishDateSort | 1999 |
| publisher | Springer |
| record_format | marc |
| spelling | Ausiello, Giorgio Verfasser aut Complexity and approximation combinatorial optimization problems and their approximability properties Buch G. Ausiello ... Berlin [u.a.] Springer 1999 XIX, 524 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier NP-vollständiges Problem (DE-588)4138229-8 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 s Komplexitätstheorie (DE-588)4120591-1 s DE-604 NP-vollständiges Problem (DE-588)4138229-8 s Approximationsalgorithmus (DE-588)4500954-5 s (DE-604)BV026365153 Buch |
| spellingShingle | Ausiello, Giorgio Complexity and approximation combinatorial optimization problems and their approximability properties NP-vollständiges Problem (DE-588)4138229-8 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| subject_GND | (DE-588)4138229-8 (DE-588)4031826-6 (DE-588)4500954-5 (DE-588)4120591-1 |
| 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_full | Complexity and approximation combinatorial optimization problems and their approximability properties Buch G. Ausiello ... |
| title_fullStr | Complexity and approximation combinatorial optimization problems and their approximability properties Buch G. Ausiello ... |
| title_full_unstemmed | Complexity and approximation combinatorial optimization problems and their approximability properties Buch G. Ausiello ... |
| 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 | NP-vollständiges Problem (DE-588)4138229-8 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| topic_facet | NP-vollständiges Problem Kombinatorische Optimierung Approximationsalgorithmus Komplexitätstheorie |
| volume_link | (DE-604)BV026365153 |
| work_keys_str_mv | AT ausiellogiorgio complexityandapproximationcombinatorialoptimizationproblemsandtheirapproximabilitypropertiesbuch |