Optimum path packing on wheels: the noncrossing case
Abstract: "We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that no two terminal pairs cross, then a path packing, i.e., a collection of edge disjoint paths connecting the given terminal pairs, of minimum length can be...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik
1993
|
| Schriftenreihe: | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC
1993,26 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that no two terminal pairs cross, then a path packing, i.e., a collection of edge disjoint paths connecting the given terminal pairs, of minimum length can be found in strongly polynomial time. Moreover, we exhibit for this case a system of linear inequalities that provides a complete and nonredundant description of the path packing polytope, which is the convex hull of all incidence vectors of path packings and their supersets." |
| Beschreibung: | 20 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009128063 | ||
| 003 | DE-604 | ||
| 005 | 20200217 | ||
| 007 | t | ||
| 008 | 940314s1993 d||| |||| 00||| engod | ||
| 035 | |a (OCoLC)32525472 | ||
| 035 | |a (DE-599)BVBBV009128063 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 | ||
| 100 | 1 | |a Grötschel, Martin |d 1948- |e Verfasser |0 (DE-588)108975282 |4 aut | |
| 245 | 1 | 0 | |a Optimum path packing on wheels |b the noncrossing case |c Martin Grötschel ; Alexander Martin ; Robert Weismantel |
| 264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik |c 1993 | |
| 300 | |a 20 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |v 1993,26 | |
| 520 | 3 | |a Abstract: "We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that no two terminal pairs cross, then a path packing, i.e., a collection of edge disjoint paths connecting the given terminal pairs, of minimum length can be found in strongly polynomial time. Moreover, we exhibit for this case a system of linear inequalities that provides a complete and nonredundant description of the path packing polytope, which is the convex hull of all incidence vectors of path packings and their supersets." | |
| 650 | 4 | |a Trees (Graph theory) | |
| 700 | 1 | |a Martin, Alexander |d 1965- |e Verfasser |0 (DE-588)1013264479 |4 aut | |
| 700 | 1 | |a Weismantel, Robert |e Verfasser |4 aut | |
| 830 | 0 | |a Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |v 1993,26 |w (DE-604)BV004801715 |9 1993,26 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006050454 | ||
Datensatz im Suchindex
| _version_ | 1804123544044437504 |
|---|---|
| any_adam_object | |
| author | Grötschel, Martin 1948- Martin, Alexander 1965- Weismantel, Robert |
| author_GND | (DE-588)108975282 (DE-588)1013264479 |
| author_facet | Grötschel, Martin 1948- Martin, Alexander 1965- Weismantel, Robert |
| author_role | aut aut aut |
| author_sort | Grötschel, Martin 1948- |
| author_variant | m g mg a m am r w rw |
| building | Verbundindex |
| bvnumber | BV009128063 |
| ctrlnum | (OCoLC)32525472 (DE-599)BVBBV009128063 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01735nam a2200313 cb4500</leader><controlfield tag="001">BV009128063</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200217 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940314s1993 d||| |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32525472</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009128063</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-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Grötschel, Martin</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)108975282</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimum path packing on wheels</subfield><subfield code="b">the noncrossing case</subfield><subfield code="c">Martin Grötschel ; Alexander Martin ; Robert Weismantel</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">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 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">Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC</subfield><subfield code="v">1993,26</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that no two terminal pairs cross, then a path packing, i.e., a collection of edge disjoint paths connecting the given terminal pairs, of minimum length can be found in strongly polynomial time. Moreover, we exhibit for this case a system of linear inequalities that provides a complete and nonredundant description of the path packing polytope, which is the convex hull of all incidence vectors of path packings and their supersets."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Martin, Alexander</subfield><subfield code="d">1965-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1013264479</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Weismantel, Robert</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC</subfield><subfield code="v">1993,26</subfield><subfield code="w">(DE-604)BV004801715</subfield><subfield code="9">1993,26</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006050454</subfield></datafield></record></collection> |
| id | DE-604.BV009128063 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:31:27Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006050454 |
| oclc_num | 32525472 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 20 S. graph. Darst. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | Konrad-Zuse-Zentrum für Informationstechnik |
| record_format | marc |
| series | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |
| series2 | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |
| spelling | Grötschel, Martin 1948- Verfasser (DE-588)108975282 aut Optimum path packing on wheels the noncrossing case Martin Grötschel ; Alexander Martin ; Robert Weismantel Berlin Konrad-Zuse-Zentrum für Informationstechnik 1993 20 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC 1993,26 Abstract: "We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that no two terminal pairs cross, then a path packing, i.e., a collection of edge disjoint paths connecting the given terminal pairs, of minimum length can be found in strongly polynomial time. Moreover, we exhibit for this case a system of linear inequalities that provides a complete and nonredundant description of the path packing polytope, which is the convex hull of all incidence vectors of path packings and their supersets." Trees (Graph theory) Martin, Alexander 1965- Verfasser (DE-588)1013264479 aut Weismantel, Robert Verfasser aut Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC 1993,26 (DE-604)BV004801715 1993,26 |
| spellingShingle | Grötschel, Martin 1948- Martin, Alexander 1965- Weismantel, Robert Optimum path packing on wheels the noncrossing case Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC Trees (Graph theory) |
| title | Optimum path packing on wheels the noncrossing case |
| title_auth | Optimum path packing on wheels the noncrossing case |
| title_exact_search | Optimum path packing on wheels the noncrossing case |
| title_full | Optimum path packing on wheels the noncrossing case Martin Grötschel ; Alexander Martin ; Robert Weismantel |
| title_fullStr | Optimum path packing on wheels the noncrossing case Martin Grötschel ; Alexander Martin ; Robert Weismantel |
| title_full_unstemmed | Optimum path packing on wheels the noncrossing case Martin Grötschel ; Alexander Martin ; Robert Weismantel |
| title_short | Optimum path packing on wheels |
| title_sort | optimum path packing on wheels the noncrossing case |
| title_sub | the noncrossing case |
| topic | Trees (Graph theory) |
| topic_facet | Trees (Graph theory) |
| volume_link | (DE-604)BV004801715 |
| work_keys_str_mv | AT grotschelmartin optimumpathpackingonwheelsthenoncrossingcase AT martinalexander optimumpathpackingonwheelsthenoncrossingcase AT weismantelrobert optimumpathpackingonwheelsthenoncrossingcase |