Approximability of unsplittable shortest path routing problems:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik
2006
|
| Schriftenreihe: | ZIP-Report
2006,02 |
| Beschreibung: | 35 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV022244895 | ||
| 003 | DE-604 | ||
| 005 | 20070529 | ||
| 007 | t | ||
| 008 | 070129s2006 |||| 00||| eng d | ||
| 035 | |a (OCoLC)255189678 | ||
| 035 | |a (DE-599)BVBBV022244895 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-188 | ||
| 082 | 0 | |a 511.5 |2 22/ger | |
| 084 | |a 510 |2 sdnb | ||
| 084 | |a 004 |2 sdnb | ||
| 100 | 1 | |a Bley, Andreas |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Approximability of unsplittable shortest path routing problems |c Andreas Bley |
| 264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik |c 2006 | |
| 300 | |a 35 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a ZIP-Report |v 2006,02 | |
| 830 | 0 | |a ZIP-Report |v 2006,02 |w (DE-604)BV013191727 |9 2006,02 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015455771 | ||
Datensatz im Suchindex
| _version_ | 1804136238408531968 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Bley, Andreas |
| author_facet | Bley, Andreas |
| author_role | aut |
| author_sort | Bley, Andreas |
| author_variant | a b ab |
| building | Verbundindex |
| bvnumber | BV022244895 |
| ctrlnum | (OCoLC)255189678 (DE-599)BVBBV022244895 |
| dewey-full | 511.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.5 |
| dewey-search | 511.5 |
| dewey-sort | 3511.5 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00887nam a2200301 cb4500</leader><controlfield tag="001">BV022244895</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20070529 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">070129s2006 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)255189678</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022244895</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-703</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bley, Andreas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximability of unsplittable shortest path routing problems</subfield><subfield code="c">Andreas Bley</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Konrad-Zuse-Zentrum für Informationstechnik</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">35 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">ZIP-Report</subfield><subfield code="v">2006,02</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">ZIP-Report</subfield><subfield code="v">2006,02</subfield><subfield code="w">(DE-604)BV013191727</subfield><subfield code="9">2006,02</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015455771</subfield></datafield></record></collection> |
| id | DE-604.BV022244895 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:37:21Z |
| indexdate | 2024-07-09T20:53:13Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015455771 |
| oclc_num | 255189678 |
| open_access_boolean | |
| owner | DE-703 DE-188 |
| owner_facet | DE-703 DE-188 |
| physical | 35 S. |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | Konrad-Zuse-Zentrum für Informationstechnik |
| record_format | marc |
| series | ZIP-Report |
| series2 | ZIP-Report |
| spelling | Bley, Andreas Verfasser aut Approximability of unsplittable shortest path routing problems Andreas Bley Berlin Konrad-Zuse-Zentrum für Informationstechnik 2006 35 S. txt rdacontent n rdamedia nc rdacarrier ZIP-Report 2006,02 ZIP-Report 2006,02 (DE-604)BV013191727 2006,02 |
| spellingShingle | Bley, Andreas Approximability of unsplittable shortest path routing problems ZIP-Report |
| title | Approximability of unsplittable shortest path routing problems |
| title_auth | Approximability of unsplittable shortest path routing problems |
| title_exact_search | Approximability of unsplittable shortest path routing problems |
| title_exact_search_txtP | Approximability of unsplittable shortest path routing problems |
| title_full | Approximability of unsplittable shortest path routing problems Andreas Bley |
| title_fullStr | Approximability of unsplittable shortest path routing problems Andreas Bley |
| title_full_unstemmed | Approximability of unsplittable shortest path routing problems Andreas Bley |
| title_short | Approximability of unsplittable shortest path routing problems |
| title_sort | approximability of unsplittable shortest path routing problems |
| volume_link | (DE-604)BV013191727 |
| work_keys_str_mv | AT bleyandreas approximabilityofunsplittableshortestpathroutingproblems |