Steiner Trees in Industry:
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Boston, MA
Springer US
2001
|
| Series: | Combinatorial Optimization
11 |
| Subjects: | |
| Online Access: | Volltext |
| Item Description: | This book is a collection of articles studying various Steiner tree prob lems with applications in industries, such as the design of electronic cir cuits, computer networking, telecommunication, and perfect phylogeny. The Steiner tree problem was initiated in the Euclidean plane. Given a set of points in the Euclidean plane, the shortest network interconnect ing the points in the set is called the Steiner minimum tree. The Steiner minimum tree may contain some vertices which are not the given points. Those vertices are called Steiner points while the given points are called terminals. The shortest network for three terminals was first studied by Fermat (1601-1665). Fermat proposed the problem of finding a point to minimize the total distance from it to three terminals in the Euclidean plane. The direct generalization is to find a point to minimize the total distance from it to n terminals, which is still called the Fermat problem today. The Steiner minimum tree problem is an indirect generalization. Schreiber in 1986 found that this generalization (i.e., the Steiner mini mum tree) was first proposed by Gauss |
| Physical Description: | 1 Online-Ressource (XI, 507 p) |
| ISBN: | 9781461302551 9781461379638 |
| ISSN: | 1388-3011 |
| DOI: | 10.1007/978-1-4613-0255-1 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042420579 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2001 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461302551 |c Online |9 978-1-4613-0255-1 | ||
| 020 | |a 9781461379638 |c Print |9 978-1-4613-7963-8 | ||
| 024 | 7 | |a 10.1007/978-1-4613-0255-1 |2 doi | |
| 035 | |a (OCoLC)905465992 | ||
| 035 | |a (DE-599)BVBBV042420579 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 004.6 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Cheng, Xiu Zhen |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Steiner Trees in Industry |c edited by Xiu Zhen Cheng, Ding-Zhu Du |
| 264 | 1 | |a Boston, MA |b Springer US |c 2001 | |
| 300 | |a 1 Online-Ressource (XI, 507 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Combinatorial Optimization |v 11 |x 1388-3011 | |
| 500 | |a This book is a collection of articles studying various Steiner tree prob lems with applications in industries, such as the design of electronic cir cuits, computer networking, telecommunication, and perfect phylogeny. The Steiner tree problem was initiated in the Euclidean plane. Given a set of points in the Euclidean plane, the shortest network interconnect ing the points in the set is called the Steiner minimum tree. The Steiner minimum tree may contain some vertices which are not the given points. Those vertices are called Steiner points while the given points are called terminals. The shortest network for three terminals was first studied by Fermat (1601-1665). Fermat proposed the problem of finding a point to minimize the total distance from it to three terminals in the Euclidean plane. The direct generalization is to find a point to minimize the total distance from it to n terminals, which is still called the Fermat problem today. The Steiner minimum tree problem is an indirect generalization. Schreiber in 1986 found that this generalization (i.e., the Steiner mini mum tree) was first proposed by Gauss | ||
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Computer Communication Networks | |
| 650 | 4 | |a Information theory | |
| 650 | 4 | |a Computer aided design | |
| 650 | 4 | |a Evolution (Biology) | |
| 650 | 4 | |a Computer engineering | |
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Computer-Aided Engineering (CAD, CAE) and Design | |
| 650 | 4 | |a Electrical Engineering | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Evolutionary Biology | |
| 650 | 4 | |a Informatik | |
| 650 | 0 | 7 | |a Steiner-Baum |0 (DE-588)4228498-3 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4143413-4 |a Aufsatzsammlung |2 gnd-content | |
| 689 | 0 | 0 | |a Steiner-Baum |0 (DE-588)4228498-3 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Du, Ding-Zhu |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4613-0255-1 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027855996 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Record in the Search Index
| _version_ | 1804153092650827776 |
|---|---|
| any_adam_object | |
| author | Cheng, Xiu Zhen |
| author_facet | Cheng, Xiu Zhen |
| author_role | aut |
| author_sort | Cheng, Xiu Zhen |
| author_variant | x z c xz xzc |
| building | Verbundindex |
| bvnumber | BV042420579 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)905465992 (DE-599)BVBBV042420579 |
| dewey-full | 004.6 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.6 |
| dewey-search | 004.6 |
| dewey-sort | 14.6 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1007/978-1-4613-0255-1 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03180nmm a2200589zcb4500</leader><controlfield tag="001">BV042420579</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2001 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461302551</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4613-0255-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461379638</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4613-7963-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4613-0255-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)905465992</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042420579</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cheng, Xiu Zhen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Steiner Trees in Industry</subfield><subfield code="c">edited by Xiu Zhen Cheng, Ding-Zhu Du</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XI, 507 p)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Combinatorial Optimization</subfield><subfield code="v">11</subfield><subfield code="x">1388-3011</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">This book is a collection of articles studying various Steiner tree prob lems with applications in industries, such as the design of electronic cir cuits, computer networking, telecommunication, and perfect phylogeny. The Steiner tree problem was initiated in the Euclidean plane. Given a set of points in the Euclidean plane, the shortest network interconnect ing the points in the set is called the Steiner minimum tree. The Steiner minimum tree may contain some vertices which are not the given points. Those vertices are called Steiner points while the given points are called terminals. The shortest network for three terminals was first studied by Fermat (1601-1665). Fermat proposed the problem of finding a point to minimize the total distance from it to three terminals in the Euclidean plane. The direct generalization is to find a point to minimize the total distance from it to n terminals, which is still called the Fermat problem today. The Steiner minimum tree problem is an indirect generalization. Schreiber in 1986 found that this generalization (i.e., the Steiner mini mum tree) was first proposed by Gauss</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Communication Networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer aided design</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Evolution (Biology)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer-Aided Engineering (CAD, CAE) and Design</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Evolutionary Biology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Steiner-Baum</subfield><subfield code="0">(DE-588)4228498-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4143413-4</subfield><subfield code="a">Aufsatzsammlung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Steiner-Baum</subfield><subfield code="0">(DE-588)4228498-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Du, Ding-Zhu</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4613-0255-1</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027855996</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4143413-4 Aufsatzsammlung gnd-content |
| genre_facet | Aufsatzsammlung |
| id | DE-604.BV042420579 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:07Z |
| institution | BVB |
| isbn | 9781461302551 9781461379638 |
| issn | 1388-3011 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027855996 |
| oclc_num | 905465992 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (XI, 507 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Springer US |
| record_format | marc |
| series2 | Combinatorial Optimization |
| spelling | Cheng, Xiu Zhen Verfasser aut Steiner Trees in Industry edited by Xiu Zhen Cheng, Ding-Zhu Du Boston, MA Springer US 2001 1 Online-Ressource (XI, 507 p) txt rdacontent c rdamedia cr rdacarrier Combinatorial Optimization 11 1388-3011 This book is a collection of articles studying various Steiner tree prob lems with applications in industries, such as the design of electronic cir cuits, computer networking, telecommunication, and perfect phylogeny. The Steiner tree problem was initiated in the Euclidean plane. Given a set of points in the Euclidean plane, the shortest network interconnect ing the points in the set is called the Steiner minimum tree. The Steiner minimum tree may contain some vertices which are not the given points. Those vertices are called Steiner points while the given points are called terminals. The shortest network for three terminals was first studied by Fermat (1601-1665). Fermat proposed the problem of finding a point to minimize the total distance from it to three terminals in the Euclidean plane. The direct generalization is to find a point to minimize the total distance from it to n terminals, which is still called the Fermat problem today. The Steiner minimum tree problem is an indirect generalization. Schreiber in 1986 found that this generalization (i.e., the Steiner mini mum tree) was first proposed by Gauss Computer science Computer Communication Networks Information theory Computer aided design Evolution (Biology) Computer engineering Computer Science Computer-Aided Engineering (CAD, CAE) and Design Electrical Engineering Theory of Computation Evolutionary Biology Informatik Steiner-Baum (DE-588)4228498-3 gnd rswk-swf 1\p (DE-588)4143413-4 Aufsatzsammlung gnd-content Steiner-Baum (DE-588)4228498-3 s 2\p DE-604 Du, Ding-Zhu Sonstige oth https://doi.org/10.1007/978-1-4613-0255-1 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Cheng, Xiu Zhen Steiner Trees in Industry Computer science Computer Communication Networks Information theory Computer aided design Evolution (Biology) Computer engineering Computer Science Computer-Aided Engineering (CAD, CAE) and Design Electrical Engineering Theory of Computation Evolutionary Biology Informatik Steiner-Baum (DE-588)4228498-3 gnd |
| subject_GND | (DE-588)4228498-3 (DE-588)4143413-4 |
| title | Steiner Trees in Industry |
| title_auth | Steiner Trees in Industry |
| title_exact_search | Steiner Trees in Industry |
| title_full | Steiner Trees in Industry edited by Xiu Zhen Cheng, Ding-Zhu Du |
| title_fullStr | Steiner Trees in Industry edited by Xiu Zhen Cheng, Ding-Zhu Du |
| title_full_unstemmed | Steiner Trees in Industry edited by Xiu Zhen Cheng, Ding-Zhu Du |
| title_short | Steiner Trees in Industry |
| title_sort | steiner trees in industry |
| topic | Computer science Computer Communication Networks Information theory Computer aided design Evolution (Biology) Computer engineering Computer Science Computer-Aided Engineering (CAD, CAE) and Design Electrical Engineering Theory of Computation Evolutionary Biology Informatik Steiner-Baum (DE-588)4228498-3 gnd |
| topic_facet | Computer science Computer Communication Networks Information theory Computer aided design Evolution (Biology) Computer engineering Computer Science Computer-Aided Engineering (CAD, CAE) and Design Electrical Engineering Theory of Computation Evolutionary Biology Informatik Steiner-Baum Aufsatzsammlung |
| url | https://doi.org/10.1007/978-1-4613-0255-1 |
| work_keys_str_mv | AT chengxiuzhen steinertreesinindustry AT dudingzhu steinertreesinindustry |