Approximation algorithms for NP-hard problems:
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Boston [u.a.]
PWS Publ.
2003
|
| Ausgabe: | [4. pr.] |
| Schlagworte: | |
| Beschreibung: | XXII, 596 S. graph. Darst. |
| ISBN: | 0534949681 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV019731909 | ||
| 003 | DE-604 | ||
| 005 | 20050316 | ||
| 007 | t | ||
| 008 | 050310s2003 d||| |||| 00||| eng d | ||
| 020 | |a 0534949681 |9 0-534-94968-1 | ||
| 035 | |a (OCoLC)254148507 | ||
| 035 | |a (DE-599)BVBBV019731909 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 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 DAT 532f |2 stub | ||
| 084 | |a MAT 410f |2 stub | ||
| 084 | |a MAT 652f |2 stub | ||
| 245 | 1 | 0 | |a Approximation algorithms for NP-hard problems |c ed. by Dorit S. Hochbaum |
| 250 | |a [4. pr.] | ||
| 264 | 1 | |a Boston [u.a.] |b PWS Publ. |c 2003 | |
| 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 NP-vollständiges Problem |0 (DE-588)4138229-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-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 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-013058791 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804133194211000320 |
|---|---|
| any_adam_object | |
| author_GND | (DE-588)121208540 |
| building | Verbundindex |
| bvnumber | BV019731909 |
| classification_rvk | QH 422 SK 870 |
| classification_tum | DAT 532f MAT 410f MAT 652f |
| ctrlnum | (OCoLC)254148507 (DE-599)BVBBV019731909 |
| 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 | [4. pr.] |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01856nam a2200517 c 4500</leader><controlfield tag="001">BV019731909</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20050316 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">050310s2003 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)254148507</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019731909</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-91G</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">DAT 532f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 410f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 652f</subfield><subfield code="2">stub</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">[4. pr.]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">PWS Publ.</subfield><subfield code="c">2003</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">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">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">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">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">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-013058791</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.BV019731909 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T20:04:50Z |
| institution | BVB |
| isbn | 0534949681 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-013058791 |
| oclc_num | 254148507 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | XXII, 596 S. graph. Darst. |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | PWS Publ. |
| record_format | marc |
| spelling | Approximation algorithms for NP-hard problems ed. by Dorit S. Hochbaum [4. pr.] Boston [u.a.] PWS Publ. 2003 XXII, 596 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier NP-vollständiges Problem (DE-588)4138229-8 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Approximationstheorie (DE-588)4120913-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 NP-vollständiges Problem (DE-588)4138229-8 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Algorithmus (DE-588)4001183-5 gnd Approximationstheorie (DE-588)4120913-8 gnd Näherungsverfahren (DE-588)4206467-3 gnd |
| subject_GND | (DE-588)4138229-8 (DE-588)4500954-5 (DE-588)4001183-5 (DE-588)4120913-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 | NP-vollständiges Problem (DE-588)4138229-8 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Algorithmus (DE-588)4001183-5 gnd Approximationstheorie (DE-588)4120913-8 gnd Näherungsverfahren (DE-588)4206467-3 gnd |
| topic_facet | NP-vollständiges Problem Approximationsalgorithmus Algorithmus Approximationstheorie Näherungsverfahren Aufsatzsammlung |
| work_keys_str_mv | AT hochbaumdorits approximationalgorithmsfornphardproblems |