An algorithm for the minimum cover problem:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Berlin
1987
|
| Schriftenreihe: | Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Preprint
87,31 |
| Schlagworte: | |
| Beschreibung: | 33 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009226642 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1987 |||| 00||| ger d | ||
| 035 | |a (OCoLC)46097485 | ||
| 035 | |a (DE-599)BVBBV009226642 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Kočetkov, Dimitrij V. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An algorithm for the minimum cover problem |c Dimitri W. Kochetkov, Bernhard Goetze, and Werner Nehrlich |
| 264 | 1 | |a Berlin |c 1987 | |
| 300 | |a 33 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Preprint |v 87,31 | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |a Minimalüberdeckung |2 gnd |9 rswk-swf | |
| 689 | 0 | 0 | |a Minimalüberdeckung |A f |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Goetze, Bernhard |e Verfasser |4 aut | |
| 700 | 1 | |a Nehrlich, Werner |e Verfasser |4 aut | |
| 830 | 0 | |a Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Preprint |v 87,31 |w (DE-604)BV006667941 |9 87,31 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006135438 | ||
Datensatz im Suchindex
| _version_ | 1804123669913403392 |
|---|---|
| any_adam_object | |
| author | Kočetkov, Dimitrij V. Goetze, Bernhard Nehrlich, Werner |
| author_facet | Kočetkov, Dimitrij V. Goetze, Bernhard Nehrlich, Werner |
| author_role | aut aut aut |
| author_sort | Kočetkov, Dimitrij V. |
| author_variant | d v k dv dvk b g bg w n wn |
| building | Verbundindex |
| bvnumber | BV009226642 |
| ctrlnum | (OCoLC)46097485 (DE-599)BVBBV009226642 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01217nam a2200349 cb4500</leader><controlfield tag="001">BV009226642</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1987 |||| 00||| ger d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46097485</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009226642</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kočetkov, Dimitrij V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An algorithm for the minimum cover problem</subfield><subfield code="c">Dimitri W. Kochetkov, Bernhard Goetze, and Werner Nehrlich</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">33 S.</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="1" ind2=" "><subfield code="a">Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Preprint</subfield><subfield code="v">87,31</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="655" ind1=" " ind2="7"><subfield code="a">Minimalüberdeckung</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Minimalüberdeckung</subfield><subfield code="A">f</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="700" ind1="1" ind2=" "><subfield code="a">Goetze, Bernhard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nehrlich, Werner</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Preprint</subfield><subfield code="v">87,31</subfield><subfield code="w">(DE-604)BV006667941</subfield><subfield code="9">87,31</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006135438</subfield></datafield></record></collection> |
| genre | Minimalüberdeckung gnd |
| genre_facet | Minimalüberdeckung |
| id | DE-604.BV009226642 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:27Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006135438 |
| oclc_num | 46097485 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 33 S. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| record_format | marc |
| series | Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Preprint |
| series2 | Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Preprint |
| spelling | Kočetkov, Dimitrij V. Verfasser aut An algorithm for the minimum cover problem Dimitri W. Kochetkov, Bernhard Goetze, and Werner Nehrlich Berlin 1987 33 S. txt rdacontent n rdamedia nc rdacarrier Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Preprint 87,31 Algorithmus (DE-588)4001183-5 gnd rswk-swf Minimalüberdeckung gnd rswk-swf Minimalüberdeckung f Algorithmus (DE-588)4001183-5 s DE-604 Goetze, Bernhard Verfasser aut Nehrlich, Werner Verfasser aut Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Preprint 87,31 (DE-604)BV006667941 87,31 |
| spellingShingle | Kočetkov, Dimitrij V. Goetze, Bernhard Nehrlich, Werner An algorithm for the minimum cover problem Karl-Weierstrass-Institut für Mathematik <Berlin, Ost>: Preprint Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4001183-5 |
| title | An algorithm for the minimum cover problem |
| title_auth | An algorithm for the minimum cover problem |
| title_exact_search | An algorithm for the minimum cover problem |
| title_full | An algorithm for the minimum cover problem Dimitri W. Kochetkov, Bernhard Goetze, and Werner Nehrlich |
| title_fullStr | An algorithm for the minimum cover problem Dimitri W. Kochetkov, Bernhard Goetze, and Werner Nehrlich |
| title_full_unstemmed | An algorithm for the minimum cover problem Dimitri W. Kochetkov, Bernhard Goetze, and Werner Nehrlich |
| title_short | An algorithm for the minimum cover problem |
| title_sort | an algorithm for the minimum cover problem |
| topic | Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmus Minimalüberdeckung |
| volume_link | (DE-604)BV006667941 |
| work_keys_str_mv | AT kocetkovdimitrijv analgorithmfortheminimumcoverproblem AT goetzebernhard analgorithmfortheminimumcoverproblem AT nehrlichwerner analgorithmfortheminimumcoverproblem |