Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation and heuristics
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2001
|
| Schriftenreihe: | Texts in theoretical computer science
|
| Schlagworte: | |
| Beschreibung: | XI, 492 S. Ill., graph. Darst. |
| ISBN: | 3540668608 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV013410641 | ||
| 003 | DE-604 | ||
| 005 | 20051031 | ||
| 007 | t | ||
| 008 | 001031s2001 ad|| |||| 00||| eng d | ||
| 016 | 7 | |a 961198486 |2 DE-101 | |
| 020 | |a 3540668608 |9 3-540-66860-8 | ||
| 035 | |a (OCoLC)247930470 | ||
| 035 | |a (DE-599)BVBBV013410641 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-20 |a DE-634 |a DE-11 | ||
| 050 | 0 | |a QA76.9.A43 | |
| 082 | 0 | |a 005.1 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Hromkovič, Juraj |d 1958- |e Verfasser |0 (DE-588)123212898 |4 aut | |
| 245 | 1 | 0 | |a Algorithmics for hard problems |b introduction to combinatorial optimization, randomization, approximation and heuristics |c Juraj Hromkovič |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2001 | |
| 300 | |a XI, 492 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Texts in theoretical computer science | |
| 650 | 4 | |a NP-hartes Problem - Approximationsalgorithmus | |
| 650 | 4 | |a NP-hartes Problem - Berechnungskomplexität | |
| 650 | 4 | |a NP-hartes Problem - Heuristik | |
| 650 | 4 | |a NP-hartes Problem - Kombinatorische Optimierung | |
| 650 | 4 | |a NP-hartes Problem - Randomisierter Algorithmus | |
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |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 Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Randomisierter Algorithmus |0 (DE-588)4176929-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a NP-hartes Problem |0 (DE-588)4621705-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Heuristik |0 (DE-588)4024772-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a NP-hartes Problem |0 (DE-588)4621705-8 |D s |
| 689 | 1 | 1 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a NP-hartes Problem |0 (DE-588)4621705-8 |D s |
| 689 | 2 | 1 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a NP-hartes Problem |0 (DE-588)4621705-8 |D s |
| 689 | 3 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a NP-hartes Problem |0 (DE-588)4621705-8 |D s |
| 689 | 4 | 1 | |a Randomisierter Algorithmus |0 (DE-588)4176929-6 |D s |
| 689 | 4 | |5 DE-604 | |
| 689 | 5 | 0 | |a NP-hartes Problem |0 (DE-588)4621705-8 |D s |
| 689 | 5 | 1 | |a Heuristik |0 (DE-588)4024772-7 |D s |
| 689 | 5 | |5 DE-604 | |
Datensatz im Suchindex
| _version_ | 1805083473383260160 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Hromkovič, Juraj 1958- |
| author_GND | (DE-588)123212898 |
| author_facet | Hromkovič, Juraj 1958- |
| author_role | aut |
| author_sort | Hromkovič, Juraj 1958- |
| author_variant | j h jh |
| building | Verbundindex |
| bvnumber | BV013410641 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A43 |
| callnumber-search | QA76.9.A43 |
| callnumber-sort | QA 276.9 A43 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 ST 130 ST 134 |
| ctrlnum | (OCoLC)247930470 (DE-599)BVBBV013410641 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Book |
| 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">BV013410641</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20051031</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">001031s2001 ad|| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">961198486</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540668608</subfield><subfield code="9">3-540-66860-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)247930470</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013410641</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-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A43</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</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">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hromkovič, Juraj</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123212898</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmics for hard problems</subfield><subfield code="b">introduction to combinatorial optimization, randomization, approximation and heuristics</subfield><subfield code="c">Juraj Hromkovič</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 492 S.</subfield><subfield code="b">Ill., 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="490" ind1="0" ind2=" "><subfield code="a">Texts in theoretical computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">NP-hartes Problem - Approximationsalgorithmus</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">NP-hartes Problem - Berechnungskomplexität</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">NP-hartes Problem - Heuristik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">NP-hartes Problem - Kombinatorische Optimierung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">NP-hartes Problem - Randomisierter Algorithmus</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">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">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Randomisierter Algorithmus</subfield><subfield code="0">(DE-588)4176929-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">NP-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Heuristik</subfield><subfield code="0">(DE-588)4024772-7</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">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</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-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-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-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">NP-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" 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="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">NP-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2="1"><subfield code="a">Randomisierter Algorithmus</subfield><subfield code="0">(DE-588)4176929-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">NP-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2="1"><subfield code="a">Heuristik</subfield><subfield code="0">(DE-588)4024772-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="5">DE-604</subfield></datafield></record></collection> |
| id | DE-604.BV013410641 |
| illustrated | Illustrated |
| indexdate | 2024-07-20T07:49:07Z |
| institution | BVB |
| isbn | 3540668608 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009151497 |
| oclc_num | 247930470 |
| open_access_boolean | |
| owner | DE-739 DE-20 DE-634 DE-11 |
| owner_facet | DE-739 DE-20 DE-634 DE-11 |
| physical | XI, 492 S. Ill., graph. Darst. |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Springer |
| record_format | marc |
| series2 | Texts in theoretical computer science |
| spelling | Hromkovič, Juraj 1958- Verfasser (DE-588)123212898 aut Algorithmics for hard problems introduction to combinatorial optimization, randomization, approximation and heuristics Juraj Hromkovič Berlin [u.a.] Springer 2001 XI, 492 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Texts in theoretical computer science NP-hartes Problem - Approximationsalgorithmus NP-hartes Problem - Berechnungskomplexität NP-hartes Problem - Heuristik NP-hartes Problem - Kombinatorische Optimierung NP-hartes Problem - Randomisierter Algorithmus Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Randomisierter Algorithmus (DE-588)4176929-6 gnd rswk-swf NP-hartes Problem (DE-588)4621705-8 gnd rswk-swf Heuristik (DE-588)4024772-7 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Informatik (DE-588)4026894-9 s DE-604 NP-hartes Problem (DE-588)4621705-8 s Berechnungskomplexität (DE-588)4134751-1 s Kombinatorische Optimierung (DE-588)4031826-6 s Approximationsalgorithmus (DE-588)4500954-5 s Randomisierter Algorithmus (DE-588)4176929-6 s Heuristik (DE-588)4024772-7 s |
| spellingShingle | Hromkovič, Juraj 1958- Algorithmics for hard problems introduction to combinatorial optimization, randomization, approximation and heuristics NP-hartes Problem - Approximationsalgorithmus NP-hartes Problem - Berechnungskomplexität NP-hartes Problem - Heuristik NP-hartes Problem - Kombinatorische Optimierung NP-hartes Problem - Randomisierter Algorithmus Approximationsalgorithmus (DE-588)4500954-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Informatik (DE-588)4026894-9 gnd Randomisierter Algorithmus (DE-588)4176929-6 gnd NP-hartes Problem (DE-588)4621705-8 gnd Heuristik (DE-588)4024772-7 gnd Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4500954-5 (DE-588)4031826-6 (DE-588)4026894-9 (DE-588)4176929-6 (DE-588)4621705-8 (DE-588)4024772-7 (DE-588)4001183-5 (DE-588)4134751-1 |
| title | Algorithmics for hard problems introduction to combinatorial optimization, randomization, approximation and heuristics |
| title_auth | Algorithmics for hard problems introduction to combinatorial optimization, randomization, approximation and heuristics |
| title_exact_search | Algorithmics for hard problems introduction to combinatorial optimization, randomization, approximation and heuristics |
| title_full | Algorithmics for hard problems introduction to combinatorial optimization, randomization, approximation and heuristics Juraj Hromkovič |
| title_fullStr | Algorithmics for hard problems introduction to combinatorial optimization, randomization, approximation and heuristics Juraj Hromkovič |
| title_full_unstemmed | Algorithmics for hard problems introduction to combinatorial optimization, randomization, approximation and heuristics Juraj Hromkovič |
| title_short | Algorithmics for hard problems |
| title_sort | algorithmics for hard problems introduction to combinatorial optimization randomization approximation and heuristics |
| title_sub | introduction to combinatorial optimization, randomization, approximation and heuristics |
| topic | NP-hartes Problem - Approximationsalgorithmus NP-hartes Problem - Berechnungskomplexität NP-hartes Problem - Heuristik NP-hartes Problem - Kombinatorische Optimierung NP-hartes Problem - Randomisierter Algorithmus Approximationsalgorithmus (DE-588)4500954-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Informatik (DE-588)4026894-9 gnd Randomisierter Algorithmus (DE-588)4176929-6 gnd NP-hartes Problem (DE-588)4621705-8 gnd Heuristik (DE-588)4024772-7 gnd Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | NP-hartes Problem - Approximationsalgorithmus NP-hartes Problem - Berechnungskomplexität NP-hartes Problem - Heuristik NP-hartes Problem - Kombinatorische Optimierung NP-hartes Problem - Randomisierter Algorithmus Approximationsalgorithmus Kombinatorische Optimierung Informatik Randomisierter Algorithmus NP-hartes Problem Heuristik Algorithmus Berechnungskomplexität |
| work_keys_str_mv | AT hromkovicjuraj algorithmicsforhardproblemsintroductiontocombinatorialoptimizationrandomizationapproximationandheuristics |