Computational complexity and the traveling salesman problem:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1981
|
| Schlagworte: | |
| Beschreibung: | 38 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021895955 | ||
| 003 | DE-604 | ||
| 005 | 20040301000000.0 | ||
| 007 | t | ||
| 008 | 910221s1981 d||| |||| 00||| und d | ||
| 035 | |a (OCoLC)634686878 | ||
| 035 | |a (DE-599)BVBBV021895955 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | |a und | ||
| 049 | |a DE-706 | ||
| 088 | |a MIT LCS TM 209 | ||
| 100 | 1 | |a Johnson, David S. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computational complexity and the traveling salesman problem |c David Johnson ; Christos Papadimitriou |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1981 | |
| 300 | |a 38 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Travelling-salesman-Problem |0 (DE-588)4185966-2 |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 Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 4 | |5 DE-604 | |
| 689 | 5 | 0 | |a Travelling-salesman-Problem |0 (DE-588)4185966-2 |D s |
| 689 | 5 | |5 DE-604 | |
| 700 | 1 | |a Papadimitriou, Christos H. |d 1949- |e Verfasser |0 (DE-588)135731909 |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015111140 | ||
Datensatz im Suchindex
| _version_ | 1804135840594526208 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Johnson, David S. Papadimitriou, Christos H. 1949- |
| author_GND | (DE-588)135731909 |
| author_facet | Johnson, David S. Papadimitriou, Christos H. 1949- |
| author_role | aut aut |
| author_sort | Johnson, David S. |
| author_variant | d s j ds dsj c h p ch chp |
| building | Verbundindex |
| bvnumber | BV021895955 |
| ctrlnum | (OCoLC)634686878 (DE-599)BVBBV021895955 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01732nam a2200481zc 4500</leader><controlfield tag="001">BV021895955</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910221s1981 d||| |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)634686878</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021895955</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT LCS TM 209</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Johnson, David S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computational complexity and the traveling salesman problem</subfield><subfield code="c">David Johnson ; Christos Papadimitriou</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1981</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">38 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">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</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">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">Travelling-salesman-Problem</subfield><subfield code="0">(DE-588)4185966-2</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">Graph</subfield><subfield code="0">(DE-588)4021842-9</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</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">Informatik</subfield><subfield code="0">(DE-588)4026894-9</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">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</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">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</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">Travelling-salesman-Problem</subfield><subfield code="0">(DE-588)4185966-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Papadimitriou, Christos H.</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135731909</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015111140</subfield></datafield></record></collection> |
| id | DE-604.BV021895955 |
| illustrated | Illustrated |
| index_date | 2024-07-02T16:04:23Z |
| indexdate | 2024-07-09T20:46:54Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015111140 |
| oclc_num | 634686878 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 38 S. graph. Darst. |
| publishDate | 1981 |
| publishDateSearch | 1981 |
| publishDateSort | 1981 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Johnson, David S. Verfasser aut Computational complexity and the traveling salesman problem David Johnson ; Christos Papadimitriou Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1981 38 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Komplexität (DE-588)4135369-9 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Travelling-salesman-Problem (DE-588)4185966-2 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Graph (DE-588)4021842-9 s Informatik (DE-588)4026894-9 s Kombinatorische Optimierung (DE-588)4031826-6 s Komplexität (DE-588)4135369-9 s Travelling-salesman-Problem (DE-588)4185966-2 s Papadimitriou, Christos H. 1949- Verfasser (DE-588)135731909 aut |
| spellingShingle | Johnson, David S. Papadimitriou, Christos H. 1949- Computational complexity and the traveling salesman problem Komplexität (DE-588)4135369-9 gnd Informatik (DE-588)4026894-9 gnd Algorithmus (DE-588)4001183-5 gnd Travelling-salesman-Problem (DE-588)4185966-2 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Graph (DE-588)4021842-9 gnd |
| subject_GND | (DE-588)4135369-9 (DE-588)4026894-9 (DE-588)4001183-5 (DE-588)4185966-2 (DE-588)4031826-6 (DE-588)4021842-9 |
| title | Computational complexity and the traveling salesman problem |
| title_auth | Computational complexity and the traveling salesman problem |
| title_exact_search | Computational complexity and the traveling salesman problem |
| title_exact_search_txtP | Computational complexity and the traveling salesman problem |
| title_full | Computational complexity and the traveling salesman problem David Johnson ; Christos Papadimitriou |
| title_fullStr | Computational complexity and the traveling salesman problem David Johnson ; Christos Papadimitriou |
| title_full_unstemmed | Computational complexity and the traveling salesman problem David Johnson ; Christos Papadimitriou |
| title_short | Computational complexity and the traveling salesman problem |
| title_sort | computational complexity and the traveling salesman problem |
| topic | Komplexität (DE-588)4135369-9 gnd Informatik (DE-588)4026894-9 gnd Algorithmus (DE-588)4001183-5 gnd Travelling-salesman-Problem (DE-588)4185966-2 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Graph (DE-588)4021842-9 gnd |
| topic_facet | Komplexität Informatik Algorithmus Travelling-salesman-Problem Kombinatorische Optimierung Graph |
| work_keys_str_mv | AT johnsondavids computationalcomplexityandthetravelingsalesmanproblem AT papadimitriouchristosh computationalcomplexityandthetravelingsalesmanproblem |