A new approximation algorithm for tandem networks with priority nodes:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Aachen
RWTH, Fachgruppe Informatik
1991
|
| Schriftenreihe: | Aachener Informatik-Berichte
1991,14 |
| Beschreibung: | 22 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV004706702 | ||
| 003 | DE-604 | ||
| 005 | 19940729 | ||
| 007 | t | ||
| 008 | 920206s1991 d||| |||| 00||| engod | ||
| 035 | |a (OCoLC)46087788 | ||
| 035 | |a (DE-599)BVBBV004706702 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-19 |a DE-29T |a DE-11 | ||
| 100 | 1 | |a Kremer, Wolfgang |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A new approximation algorithm for tandem networks with priority nodes |c Wolfgang Kremer ; Andreas Fasbender |
| 264 | 1 | |a Aachen |b RWTH, Fachgruppe Informatik |c 1991 | |
| 300 | |a 22 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Aachener Informatik-Berichte |v 1991,14 | |
| 700 | 1 | |a Fasbender, Andreas |e Verfasser |4 aut | |
| 830 | 0 | |a Aachener Informatik-Berichte |v 1991,14 |w (DE-604)BV001793488 |9 1991,14 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-002892122 | ||
Datensatz im Suchindex
| _version_ | 1804118824216166400 |
|---|---|
| any_adam_object | |
| author | Kremer, Wolfgang Fasbender, Andreas |
| author_facet | Kremer, Wolfgang Fasbender, Andreas |
| author_role | aut aut |
| author_sort | Kremer, Wolfgang |
| author_variant | w k wk a f af |
| building | Verbundindex |
| bvnumber | BV004706702 |
| ctrlnum | (OCoLC)46087788 (DE-599)BVBBV004706702 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00933nam a2200277 cb4500</leader><controlfield tag="001">BV004706702</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940729 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">920206s1991 d||| |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46087788</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004706702</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-19</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kremer, Wolfgang</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A new approximation algorithm for tandem networks with priority nodes</subfield><subfield code="c">Wolfgang Kremer ; Andreas Fasbender</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Aachen</subfield><subfield code="b">RWTH, Fachgruppe Informatik</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">22 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="490" ind1="1" ind2=" "><subfield code="a">Aachener Informatik-Berichte</subfield><subfield code="v">1991,14</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fasbender, Andreas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Aachener Informatik-Berichte</subfield><subfield code="v">1991,14</subfield><subfield code="w">(DE-604)BV001793488</subfield><subfield code="9">1991,14</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002892122</subfield></datafield></record></collection> |
| id | DE-604.BV004706702 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T16:16:26Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002892122 |
| oclc_num | 46087788 |
| open_access_boolean | |
| owner | DE-19 DE-BY-UBM DE-29T DE-11 |
| owner_facet | DE-19 DE-BY-UBM DE-29T DE-11 |
| physical | 22 S. graph. Darst. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| publisher | RWTH, Fachgruppe Informatik |
| record_format | marc |
| series | Aachener Informatik-Berichte |
| series2 | Aachener Informatik-Berichte |
| spelling | Kremer, Wolfgang Verfasser aut A new approximation algorithm for tandem networks with priority nodes Wolfgang Kremer ; Andreas Fasbender Aachen RWTH, Fachgruppe Informatik 1991 22 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Aachener Informatik-Berichte 1991,14 Fasbender, Andreas Verfasser aut Aachener Informatik-Berichte 1991,14 (DE-604)BV001793488 1991,14 |
| spellingShingle | Kremer, Wolfgang Fasbender, Andreas A new approximation algorithm for tandem networks with priority nodes Aachener Informatik-Berichte |
| title | A new approximation algorithm for tandem networks with priority nodes |
| title_auth | A new approximation algorithm for tandem networks with priority nodes |
| title_exact_search | A new approximation algorithm for tandem networks with priority nodes |
| title_full | A new approximation algorithm for tandem networks with priority nodes Wolfgang Kremer ; Andreas Fasbender |
| title_fullStr | A new approximation algorithm for tandem networks with priority nodes Wolfgang Kremer ; Andreas Fasbender |
| title_full_unstemmed | A new approximation algorithm for tandem networks with priority nodes Wolfgang Kremer ; Andreas Fasbender |
| title_short | A new approximation algorithm for tandem networks with priority nodes |
| title_sort | a new approximation algorithm for tandem networks with priority nodes |
| volume_link | (DE-604)BV001793488 |
| work_keys_str_mv | AT kremerwolfgang anewapproximationalgorithmfortandemnetworkswithprioritynodes AT fasbenderandreas anewapproximationalgorithmfortandemnetworkswithprioritynodes |