Edge-disjoint T-paths of minimum total cost:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1993
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1465 |
| Schlagworte: | |
| Beschreibung: | 66 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009034275 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)29864825 | ||
| 035 | |a (DE-599)BVBBV009034275 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 050 | 0 | |a QA76 | |
| 100 | 1 | |a Karzanov, Alexander V. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Edge-disjoint T-paths of minimum total cost |c by Alexander Karzanov |
| 264 | 1 | |a Stanford, Calif. |c 1993 | |
| 300 | |a 66 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1465 | |
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Polynomials | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1465 |w (DE-604)BV008928280 |9 1465 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005976942 | ||
Datensatz im Suchindex
| _version_ | 1804123387711193088 |
|---|---|
| any_adam_object | |
| author | Karzanov, Alexander V. |
| author_facet | Karzanov, Alexander V. |
| author_role | aut |
| author_sort | Karzanov, Alexander V. |
| author_variant | a v k av avk |
| building | Verbundindex |
| bvnumber | BV009034275 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76 |
| callnumber-search | QA76 |
| callnumber-sort | QA 276 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)29864825 (DE-599)BVBBV009034275 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00952nam a2200301 cb4500</leader><controlfield tag="001">BV009034275</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)29864825</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009034275</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">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Karzanov, Alexander V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Edge-disjoint T-paths of minimum total cost</subfield><subfield code="c">by Alexander Karzanov</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">66 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">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1465</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polynomials</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1465</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1465</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005976942</subfield></datafield></record></collection> |
| id | DE-604.BV009034275 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:58Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005976942 |
| oclc_num | 29864825 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 66 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Karzanov, Alexander V. Verfasser aut Edge-disjoint T-paths of minimum total cost by Alexander Karzanov Stanford, Calif. 1993 66 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1465 Combinatorial optimization Polynomials Computer Science Department: Report STAN CS Stanford University 1465 (DE-604)BV008928280 1465 |
| spellingShingle | Karzanov, Alexander V. Edge-disjoint T-paths of minimum total cost Combinatorial optimization Polynomials |
| title | Edge-disjoint T-paths of minimum total cost |
| title_auth | Edge-disjoint T-paths of minimum total cost |
| title_exact_search | Edge-disjoint T-paths of minimum total cost |
| title_full | Edge-disjoint T-paths of minimum total cost by Alexander Karzanov |
| title_fullStr | Edge-disjoint T-paths of minimum total cost by Alexander Karzanov |
| title_full_unstemmed | Edge-disjoint T-paths of minimum total cost by Alexander Karzanov |
| title_short | Edge-disjoint T-paths of minimum total cost |
| title_sort | edge disjoint t paths of minimum total cost |
| topic | Combinatorial optimization Polynomials |
| topic_facet | Combinatorial optimization Polynomials |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT karzanovalexanderv edgedisjointtpathsofminimumtotalcost |