Frontiers in algorithmics and algorithmic aspects in information and management: Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings
Gespeichert in:
| Weitere Verfasser: | |
|---|---|
| Format: | Tagungsbericht Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2012
|
| Schriftenreihe: | Lecture notes in computer science
7285 |
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | XVII, 370 S. graph. Darst. |
| ISBN: | 3642296998 9783642296994 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV040132069 | ||
| 003 | DE-604 | ||
| 005 | 20120523 | ||
| 007 | t | ||
| 008 | 120514s2012 gw d||| |||| 10||| eng d | ||
| 015 | |a 12,N13 |2 dnb | ||
| 016 | 7 | |a 1021048119 |2 DE-101 | |
| 020 | |a 3642296998 |9 3-642-29699-8 | ||
| 020 | |a 9783642296994 |c Pb. : ca. EUR 66.34 (DE) (freier Pr.), ca. EUR 68.20 (AT) (freier Pr.), ca. sfr 83.00 (freier Pr.) |9 978-3-642-29699-4 | ||
| 024 | 3 | |a 9783642296994 | |
| 028 | 5 | 2 | |a Best.-Nr.: 86091339 |
| 035 | |a (OCoLC)799086388 | ||
| 035 | |a (DE-599)DNB1021048119 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-706 |a DE-83 |a DE-91G |a DE-11 | ||
| 082 | 0 | |a 004.0151 |2 22/ger | |
| 084 | |a SS 4800 |0 (DE-625)143528: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 245 | 1 | 0 | |a Frontiers in algorithmics and algorithmic aspects in information and management |b Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings |c Jack Snoeyink ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2012 | |
| 300 | |a XVII, 370 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 7285 | |
| 650 | 0 | 7 | |a Optimierungsproblem |0 (DE-588)4390818-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2012 |z Peking |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | 2 | |a Optimierungsproblem |0 (DE-588)4390818-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Snoeyink, Jack |4 edt | |
| 711 | 2 | |a FAW-AAIM |d 2012 |c Peking |j Sonstige |0 (DE-588)1022159798 |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-642-29700-7 |
| 830 | 0 | |a Lecture notes in computer science |v 7285 |w (DE-604)BV000000607 |9 7285 | |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3997284&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024989202&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-024989202 | |
Datensatz im Suchindex
| _version_ | 1805146599020560384 |
|---|---|
| adam_text |
IMAGE 1
TABLE O F C O N T E N T S
OPTIMAL BINARY REPRESENTATION OF MOSAIC FLOORPLANS AND BAXTER
PERMUTATIONS 1
BRYAN HE
SUCCINCT STRICTLY CONVEX GREEDY DRAWING OF 3-CONNECTED PLANE GRAPHS 13
JIUN-JIE WANG AND, X I N HE
WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE SUM-TYPE HAMMING DISTANCE
26
LONGCHENG LIU, YONG CHEN, BIAO WU, AND ENYU YAO
VORONOI DIAGRAM WITH VISUAL RESTRICTION 36
CHENGLIN FAN. JUN LUO. WENCHENG WANG, AND BINHAI ZHU
MINIMIZATION OF THE MAXIMUM DISTANCE BETWEEN THE TWO GUARDS PATROLLING A
POLYGONAL REGION 47
XUEHOU TAN AND BO JIANG
ON COVERING POINTS WITH MINIMUM TURNS 58
MINGHUI JIANG
ON ENVY-FREE PARETO EFFICIENT PRICING 70
X I A HUA
ONLINE PRICING FOR MULTI-TYPE OF ITEMS 82
YONG ZHANG, FRANCIS Y.L. CHIN, AND HING-FUNG TING
ALGORITHMS WITH LIMITED NUMBER OF PREEMPTIONS FOR SCHEDULING ON PARALLEL
MACHINES 93
YIWEI JIANG, ZEWEI WENG, AND JUELIANG HU
COMPUTING' MAXIMUM NON-CROSSING MATCHING IN CONVEX BIPARTITE GRAPHS 105
DANNY Z. CHEN, XIAOMIN LIU, AND HAITAO WANG
ALGORITHMS FOR BANDWIDTH CONSECUTIVE MULTICOLORINGS OF GRAPHS (EXTENDED
ABSTRACT) 117
KAZUHIDE NISHIKAWA, TAKAO NISHIZEKI, AND XIAO ZHOU
INDEPENDENT DOMINATION ON TREE CONVEX BIPARTITE GRAPHS 129
YU SONG. TIAN LIU, AND K E X U
HTTP://D-NB.INFO/1021048119
IMAGE 2
XVI TABLE OF CONTENTS
ON-LINE SCHEDULING OF PARALLEL JOBS IN HETEROGENEOUS MULTIPLE CLUSTERS
139
DESHI YE AND LILI MEI
ON MULTIPROCESSOR TEMPERATURE-AWARE SCHEDULING PROBLEMS 149
EVRIPIDIS BAMPIS, DIMITRIOS LETSIOS. GIORGIO LUCARELLI, EVANGELOS
MARKAKIS, AND IOANNIS MILIS
ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER 161
YAN LAN, X I N CHEN, NING DING, GYORGY DOSA, AND X I N HAN
A DENSE HIERARCHY OF SUBLINEAR TIME APPROXIMATION SCHEMES FOR BIN
PACKING 172
RICHARD BEIGEL AND B I N FU
MULTIVARIATE POLYNOMIAL INTEGRATION AND DIFFERENTIATION ARE POLYNOMIAL
TIME INAPPROXIMABLE UNLESS P = N P 182
BIN FU
SOME REMARKS ON THE INCOMPRESSIBILITY OF WIDTH-PARAMETERIZED SAT
INSTANCES 192
BANGSHENG TANG
KERNELS FOR PACKING AND COVERING PROBLEMS (EXTENDED ABSTRACT) 199 JIANER
CHEN, HENNING FERNAU, PETER SHAW, JIANXIN WANG, AND ZHIBIAO YANG
THE WORST-CASE UPPER BOUND FOR EXACT 3-SATISFIABILITY WITH T H E NUMBER
OF CLAUSES AS THE PARAMETER 212
JUNPING ZHOU AND MINGHAO YIN
FIXED-PARAMETER TRACTABILITY OF ALMOST CSP PROBLEM WITH DECISIVE
RELATIONS 224
CHIHAO ZHANG AND HONGYANG ZHANG
ON EDITING GRAPHS INTO 2-CLUB CLUSTERS 235
HONG LIU, PENG ZHANG, AND DARNING ZHU
SOLVING GENERALIZED OPTIMIZATION PROBLEMS SUBJECT T O SMT CONSTRAINTS
247
FEIFEI MA, JUN YAN, AND JIAN ZHANG
SOLVING DIFFICULT SAT PROBLEMS BY USING OBDDS AND GREEDY CLIQUE
DECOMPOSITION 259
YANYAN XU, WEI CHEN, KAILE SU, AND WENHUI ZHANG
ZERO-SUM FLOW NUMBERS OF REGULAR GRAPHS 269
TAO-MING WANG AND SHIH-WEI H U
IMAGE 3
TABLE OF CONTENTS XVII
MORE EFFICIENT PARALLEL INTEGER SORTING 279
YIJIE HAN AND X I N HE
FAST RELATIVE LEMPEL-ZIV SELF-INDEX FOR SIMILAR SEQUENCES 291
HUY HOANG DO, JESPER JANSSON, KUNIHIKO SADAKANE, AND WING-KIN SUNG
A COMPARISON OF PERFORMANCE MEASURES VIA ONLINE SEARCH 303
JOAN BOYAR, K I M S. LARSEN, AND ABYAYANANDA MAITI
ONLINE EXPLORATION OF ALL VERTICES IN A SIMPLE POLYGON 315
YUYA HIGASHIKAWA AND NAOKI KATOH
IN-PLACE ALGORITHMS FOR COMPUTING A LARGEST CLIQUE IN GEOMETRIC
INTERSECTION GRAPHS 327
MINATI DE, SUBHAS C. NANDY, AND SASANKA ROY
THE BLACK-AND-WHITE COLORING PROBLEM ON DISTANCE-HEREDITARY GRAPHS AND
STRONGLY CHORDAL GRAPHS 339
TON KLOKS, SHEUNG-HUNG POON, FENG-REN TSAI. AND YUE-LI WANG
AN IMPROVED APPROXIMATION ALGORITHM FOR THE BANDPASS PROBLEM 351 WEITIAN
TONG, RANDY GOEBEL, WEI DING, AND GUOHUI L I N
PARTIAL DEGREE BOUNDED EDGE PACKING PROBLEM 359
PENG ZHANG
ERRATUM: THE APPROXIMABILITY OF THE EXEMPLAR BREAKPOINT DISTANCE PROBLEM
368
ZHIXIANG CHEN, BIN FU. AND BINHAI ZHU
A U T H O R I N D E X 369 |
| any_adam_object | 1 |
| author2 | Snoeyink, Jack |
| author2_role | edt |
| author2_variant | j s js |
| author_facet | Snoeyink, Jack |
| building | Verbundindex |
| bvnumber | BV040132069 |
| classification_rvk | SS 4800 |
| ctrlnum | (OCoLC)799086388 (DE-599)DNB1021048119 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV040132069</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120523</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">120514s2012 gw d||| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">12,N13</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1021048119</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642296998</subfield><subfield code="9">3-642-29699-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642296994</subfield><subfield code="c">Pb. : ca. EUR 66.34 (DE) (freier Pr.), ca. EUR 68.20 (AT) (freier Pr.), ca. sfr 83.00 (freier Pr.)</subfield><subfield code="9">978-3-642-29699-4</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642296994</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 86091339</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)799086388</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1021048119</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 4800</subfield><subfield code="0">(DE-625)143528:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Frontiers in algorithmics and algorithmic aspects in information and management</subfield><subfield code="b">Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings</subfield><subfield code="c">Jack Snoeyink ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 370 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">Lecture notes in computer science</subfield><subfield code="v">7285</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2012</subfield><subfield code="z">Peking</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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="1"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Optimierungsproblem</subfield><subfield code="0">(DE-588)4390818-4</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">Snoeyink, Jack</subfield><subfield code="4">edt</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">FAW-AAIM</subfield><subfield code="d">2012</subfield><subfield code="c">Peking</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)1022159798</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-642-29700-7</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7285</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">7285</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3997284&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB 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=024989202&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024989202</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2012 Peking gnd-content |
| genre_facet | Konferenzschrift 2012 Peking |
| id | DE-604.BV040132069 |
| illustrated | Illustrated |
| indexdate | 2024-07-21T00:32:27Z |
| institution | BVB |
| institution_GND | (DE-588)1022159798 |
| isbn | 3642296998 9783642296994 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024989202 |
| oclc_num | 799086388 |
| open_access_boolean | |
| owner | DE-706 DE-83 DE-91G DE-BY-TUM DE-11 |
| owner_facet | DE-706 DE-83 DE-91G DE-BY-TUM DE-11 |
| physical | XVII, 370 S. graph. Darst. |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings Jack Snoeyink ... (eds.) Berlin [u.a.] Springer 2012 XVII, 370 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 7285 Optimierungsproblem (DE-588)4390818-4 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2012 Peking gnd-content Algorithmus (DE-588)4001183-5 s Komplexitätstheorie (DE-588)4120591-1 s Optimierungsproblem (DE-588)4390818-4 s DE-604 Snoeyink, Jack edt FAW-AAIM 2012 Peking Sonstige (DE-588)1022159798 oth Erscheint auch als Online-Ausgabe 978-3-642-29700-7 Lecture notes in computer science 7285 (DE-604)BV000000607 7285 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3997284&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024989202&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings Lecture notes in computer science Optimierungsproblem (DE-588)4390818-4 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4390818-4 (DE-588)4120591-1 (DE-588)4001183-5 (DE-588)1071861417 |
| title | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings |
| title_auth | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings |
| title_exact_search | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings |
| title_full | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings Jack Snoeyink ... (eds.) |
| title_fullStr | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings Jack Snoeyink ... (eds.) |
| title_full_unstemmed | Frontiers in algorithmics and algorithmic aspects in information and management Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings Jack Snoeyink ... (eds.) |
| title_short | Frontiers in algorithmics and algorithmic aspects in information and management |
| title_sort | frontiers in algorithmics and algorithmic aspects in information and management joint international conference faw aaim 2012 beijing china may 14 16 2012 proceedings |
| title_sub | Joint international conference, FAW-AAIM 2012, Beijing, China, May 14 - 16, 2012 ; proceedings |
| topic | Optimierungsproblem (DE-588)4390818-4 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Optimierungsproblem Komplexitätstheorie Algorithmus Konferenzschrift 2012 Peking |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3997284&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024989202&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT snoeyinkjack frontiersinalgorithmicsandalgorithmicaspectsininformationandmanagementjointinternationalconferencefawaaim2012beijingchinamay14162012proceedings AT fawaaimpeking frontiersinalgorithmicsandalgorithmicaspectsininformationandmanagementjointinternationalconferencefawaaim2012beijingchinamay14162012proceedings |