Spanning trees and optimization problems:
"With logical organization, well-chosen topics, and easy-to-understand pseudocode, this book is not only a full, rigorous treatment of theory and applications, but also an excellent handbook for spanning tree algorithms. It will be a welcome addition to your reference shelf, whether your intere...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boca Raton, FL [u.a.]
Chapman & Hall/CRC
2004
|
| Schriftenreihe: | Discrete mathematics and its applications
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Zusammenfassung: | "With logical organization, well-chosen topics, and easy-to-understand pseudocode, this book is not only a full, rigorous treatment of theory and applications, but also an excellent handbook for spanning tree algorithms. It will be a welcome addition to your reference shelf, whether your interests lie in graph and approximation algorithms for theoretical work or you use graph techniques to solve practical problems."--BOOK JACKET. |
| Beschreibung: | XV, 184 S. |
| ISBN: | 1584884363 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV017648517 | ||
| 003 | DE-604 | ||
| 005 | 20040927 | ||
| 007 | t | ||
| 008 | 031111s2004 xxu |||| 00||| eng d | ||
| 010 | |a 2003063533 | ||
| 020 | |a 1584884363 |9 1-584-88436-3 | ||
| 035 | |a (OCoLC)53324988 | ||
| 035 | |a (DE-599)BVBBV017648517 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-20 |a DE-634 |a DE-11 | ||
| 050 | 0 | |a QA166.2 | |
| 082 | 0 | |a 511/.52 |2 22 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a MAT 055f |2 stub | ||
| 084 | |a DAT 537f |2 stub | ||
| 084 | |a MAT 910f |2 stub | ||
| 100 | 1 | |a Wu, Bang Ye |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Spanning trees and optimization problems |c Bang Ye Wu ; Kun-Mao Chao |
| 264 | 1 | |a Boca Raton, FL [u.a.] |b Chapman & Hall/CRC |c 2004 | |
| 300 | |a XV, 184 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Discrete mathematics and its applications | |
| 520 | 1 | |a "With logical organization, well-chosen topics, and easy-to-understand pseudocode, this book is not only a full, rigorous treatment of theory and applications, but also an excellent handbook for spanning tree algorithms. It will be a welcome addition to your reference shelf, whether your interests lie in graph and approximation algorithms for theoretical work or you use graph techniques to solve practical problems."--BOOK JACKET. | |
| 650 | 7 | |a Algorithme |2 rasuqam | |
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 7 | |a Arbre (Théorie des graphes) |2 rasuqam | |
| 650 | 7 | |a Arbre couvrant |2 rasuqam | |
| 650 | 7 | |a Bomen (wiskunde) |2 gtt | |
| 650 | 7 | |a Optimaliseren |2 gtt | |
| 650 | 7 | |a Optimisation mathématique |2 rasuqam | |
| 650 | 7 | |a Otimização matemática |2 larpcal | |
| 650 | 7 | |a Teoria dos grafos |2 larpcal | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Trees (Graph theory) |x Data processing | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 2 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Chao, Kun-Mao |e Sonstige |4 oth | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010613541&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-010613541 | ||
Datensatz im Suchindex
| _version_ | 1804130393338675200 |
|---|---|
| adam_text | DISCRETE MATHEMATICS AND ITS APPLICATIONS SPANNING TREES AND
OPTIMIZATION PROBLEMS BANG YE WU DEPARTMENT OF COMPUTER SCIENCE AND
INFORMATION ENGINEERING, SHU-TE UNIVERSITY, YEN-CHAU, KAOHSIUNG COUNTY,
TAIWAN 824 KUN-MAO CHAO DEPARTMENT OF COMPUTER SCIENCE AND INFORMATION
ENGINEERING, NATIONAL TAIWAN UNIVERSITY, TAIPEI, TAIWAN 106 CHAPMAN &
HALL/CRC A CRC PRESS COMPANY BOCA RATON LONDON NEW YORK WASHINGTON, D.C.
CONTENTS 1 SPANNING TREES 1 1.1 COUNTING SPANNING TREES 1 2 MINIMUM
SPANNING TREES 9 2.1 INTRODUCTION 9 2.2 BORUEVKA S ALGORITHM 11 2.3
PRIM S ALGORITHM 13 2.4 KRUSKAL S ALGORITHM 15 2.5 APPLICATIONS 17 2.5.1
CABLE TV 17 2.5.2 CIRCUIT DESIGN 17 2.5.3 ISLANDS CONNECTION 17 2.5.4
CLUSTERING GENE EXPRESSION DATA 17 2.5.5 MST-BASED APPROXIMATIONS 18 2.6
SUMMARY 18 BIBLIOGRAPHIE NOTES AND FURTHER READING 19 EXERCISES 20 3
SHORTEST-PATHS TREES 23 3.1 INTRODUCTION 23 3.2 DIJKSTRA S ALGORITHM 25
3.3 THE BELLMAN-FORD ALGORITHM 33 3.4 APPLICATIONS 35 3.4.1 MULTICAST 37
3.4.2 SPT-BASED APPROXIMATIONS 37 3.5 SUMMARY 38 BIBLIOGRAPHIE NOTES AND
FURTHER READING 38 EXERCISES 39 4 MINIMUM ROUTING COST SPANNING TREES 41
4.1 INTRODUCTION 41 4.2 APPROXIMATING BY A SHORTEST-PATHS TREE 44 4.2.1
A SIMPLE ANALYSIS 44 4.2.2 SOLUTION DECOMPOSITION 46 4.3 APPROXIMATING
BY A GENERAL STAR 47 4.3.1 SEPARATORS AND GENERAL STARS 47 4.3.2 A
15/8-APPROXIMATION ALGORITHM 52 XI XII CONTENTS 4.3.3 A
3/2-APPROXIMATION ALGORITHM 55 4.3.4 FURTHER IMPROVEMENT 57 4.4 A
REDUCTION TO THE METRIE CASE 58 4.5 A POLYNOMIAL TIME APPROXIMATION
SCHEME 62 4.5.1 OVERVIEW 62 4.5.2 THE 5-SPINE OF A TREE 66 4.5.3 LOWER
BOUND 69 4.5.4 FROM TREES TO STARS 70 4.5.5 FINDING AN OPTIMAL FC-STAR
74 4.6 APPLICATIONS 79 4.6.1 NETWORK DESIGN 79 4.6.2 COMPUTATIONAL
BIOLOGY 79 4.7 SUMMARY 82 BIBLIOGRAPHIE NOTES AND FURTHER READING 82
EXERCISES 83 5 OPTIMAL COMMUNICATION SPANNING TVEES 85 5.1 INTRODUCTION
85 5.2 PRODUCT-REQUIREMENT 87 5.2.1 OVERVIEW 87 5.2.2 PRELIMINARIES 88
5.2.3 APPROXIMATING BY 2-STARS 91 5.2.4 A POLYNOMIAL TIME APPROXIMATION
SCHEME 98 5.3 SUM-REQUIREMENT 104 5.4 MULTIPLE SOURCES 109 5.4.1
COMPUTATIONAL COMPLEXITY FOR FIXED P 110 5.4.2 A PTAS FOR THE 2-MRCT 115
5.5 APPLICATIONS 124 5.6 SUMMARY 125 BIBLIOGRAPHIE NOTES AND FURTHER
READING 125 EXERCISES 127 6 BALANCING THE TREE COSTS 129 6.1
INTRODUCTION 129 6.2 LIGHT APPROXIMATE SHORTEST-PATHS TREES 130 6.2.1
OVERVIEW 130 6.2.2 THE ALGORITHM 131 6.2.3 THE ANALYSIS OF THE ALGORITHM
134 6.3 LIGHT APPROXIMATE ROUTING COST SPANNING TREES 136 6.3.1 OVERVIEW
136 6.3.2 THE ALGORITHM 137 6.3.3 THE PERFORMANCE ANALYSIS 140 6.3.4 ON
GENERAL GRAPHS 143 6.4 APPLICATIONS 143 6.5 SUMMARY 144 CONTENTS XIII
BIBLIOGRAPHIE NOTES AND FURTHER READING 144 EXERCISES 145 7 STEINER
TREES AND SOME OTHER PROBLEMS 147 7.1 STEINER MINIMAL TREES 147 7.1.1
APPROXIMATION BY MST 148 7.1.2 INIPROVED APPROXIMATION ALGORITHNIS 151
7.2 TREES AND DIAMETERS 154 7.2.1 ECCENTRICITIES, DIAMETERS, AND RADII
154 7.2.2 THE MINIMUM DIAMETER SPANNING TREES 157 7.3 MAXIMUM LEAF
SPANNING TREES 162 7.3.1 LEAFY TREES AND LEAFY FORESTS 162 7.3.2 THE
ALGORITHM 165 7.3.3 PERFORMANCE RATIO 166 7.4 SOME OTHER PROBLEMS 168
7.4.1 NETWORK DESIGN 169 7.4.2 COMPUTATIONAL BIOLOGY 170 BIBLIOGRAPHIE
NOTES AND FURTHER READING 173 EXERCISES 174 REFERENCES 175 INDEX 183
|
| any_adam_object | 1 |
| author | Wu, Bang Ye |
| author_facet | Wu, Bang Ye |
| author_role | aut |
| author_sort | Wu, Bang Ye |
| author_variant | b y w by byw |
| building | Verbundindex |
| bvnumber | BV017648517 |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166.2 |
| callnumber-search | QA166.2 |
| callnumber-sort | QA 3166.2 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 |
| classification_tum | MAT 055f DAT 537f MAT 910f |
| ctrlnum | (OCoLC)53324988 (DE-599)BVBBV017648517 |
| dewey-full | 511/.52 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.52 |
| dewey-search | 511/.52 |
| dewey-sort | 3511 252 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02646nam a2200625zc 4500</leader><controlfield tag="001">BV017648517</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040927 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">031111s2004 xxu |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2003063533</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1584884363</subfield><subfield code="9">1-584-88436-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)53324988</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV017648517</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="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166.2</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.52</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 910f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wu, Bang Ye</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Spanning trees and optimization problems</subfield><subfield code="c">Bang Ye Wu ; Kun-Mao Chao</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boca Raton, FL [u.a.]</subfield><subfield code="b">Chapman & Hall/CRC</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 184 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="0" ind2=" "><subfield code="a">Discrete mathematics and its applications</subfield></datafield><datafield tag="520" ind1="1" ind2=" "><subfield code="a">"With logical organization, well-chosen topics, and easy-to-understand pseudocode, this book is not only a full, rigorous treatment of theory and applications, but also an excellent handbook for spanning tree algorithms. It will be a welcome addition to your reference shelf, whether your interests lie in graph and approximation algorithms for theoretical work or you use graph techniques to solve practical problems."--BOOK JACKET.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithme</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Arbre (Théorie des graphes)</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Arbre couvrant</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bomen (wiskunde)</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimaliseren</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimisation mathématique</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Otimização matemática</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Teoria dos grafos</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chao, Kun-Mao</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010613541&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-010613541</subfield></datafield></record></collection> |
| id | DE-604.BV017648517 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T19:20:19Z |
| institution | BVB |
| isbn | 1584884363 |
| language | English |
| lccn | 2003063533 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010613541 |
| oclc_num | 53324988 |
| open_access_boolean | |
| owner | DE-20 DE-634 DE-11 |
| owner_facet | DE-20 DE-634 DE-11 |
| physical | XV, 184 S. |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Chapman & Hall/CRC |
| record_format | marc |
| series2 | Discrete mathematics and its applications |
| spelling | Wu, Bang Ye Verfasser aut Spanning trees and optimization problems Bang Ye Wu ; Kun-Mao Chao Boca Raton, FL [u.a.] Chapman & Hall/CRC 2004 XV, 184 S. txt rdacontent n rdamedia nc rdacarrier Discrete mathematics and its applications "With logical organization, well-chosen topics, and easy-to-understand pseudocode, this book is not only a full, rigorous treatment of theory and applications, but also an excellent handbook for spanning tree algorithms. It will be a welcome addition to your reference shelf, whether your interests lie in graph and approximation algorithms for theoretical work or you use graph techniques to solve practical problems."--BOOK JACKET. Algorithme rasuqam Algoritmen gtt Arbre (Théorie des graphes) rasuqam Arbre couvrant rasuqam Bomen (wiskunde) gtt Optimaliseren gtt Optimisation mathématique rasuqam Otimização matemática larpcal Teoria dos grafos larpcal Datenverarbeitung Mathematical optimization Trees (Graph theory) Data processing Algorithmus (DE-588)4001183-5 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s Algorithmus (DE-588)4001183-5 s Optimierung (DE-588)4043664-0 s DE-604 Chao, Kun-Mao Sonstige oth GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010613541&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Wu, Bang Ye Spanning trees and optimization problems Algorithme rasuqam Algoritmen gtt Arbre (Théorie des graphes) rasuqam Arbre couvrant rasuqam Bomen (wiskunde) gtt Optimaliseren gtt Optimisation mathématique rasuqam Otimização matemática larpcal Teoria dos grafos larpcal Datenverarbeitung Mathematical optimization Trees (Graph theory) Data processing Algorithmus (DE-588)4001183-5 gnd Optimierung (DE-588)4043664-0 gnd Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4043664-0 (DE-588)4113782-6 |
| title | Spanning trees and optimization problems |
| title_auth | Spanning trees and optimization problems |
| title_exact_search | Spanning trees and optimization problems |
| title_full | Spanning trees and optimization problems Bang Ye Wu ; Kun-Mao Chao |
| title_fullStr | Spanning trees and optimization problems Bang Ye Wu ; Kun-Mao Chao |
| title_full_unstemmed | Spanning trees and optimization problems Bang Ye Wu ; Kun-Mao Chao |
| title_short | Spanning trees and optimization problems |
| title_sort | spanning trees and optimization problems |
| topic | Algorithme rasuqam Algoritmen gtt Arbre (Théorie des graphes) rasuqam Arbre couvrant rasuqam Bomen (wiskunde) gtt Optimaliseren gtt Optimisation mathématique rasuqam Otimização matemática larpcal Teoria dos grafos larpcal Datenverarbeitung Mathematical optimization Trees (Graph theory) Data processing Algorithmus (DE-588)4001183-5 gnd Optimierung (DE-588)4043664-0 gnd Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Algorithme Algoritmen Arbre (Théorie des graphes) Arbre couvrant Bomen (wiskunde) Optimaliseren Optimisation mathématique Otimização matemática Teoria dos grafos Datenverarbeitung Mathematical optimization Trees (Graph theory) Data processing Algorithmus Optimierung Graphentheorie |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010613541&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT wubangye spanningtreesandoptimizationproblems AT chaokunmao spanningtreesandoptimizationproblems |