Frontiers in algorithmics and algorithmic aspects in information and management: joint international conference, FAW AAIM 2011, Jinhua, China, May 28 - 31, 2011 ; proceedings
Gespeichert in:
Format: | Tagungsbericht Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
2011
|
Schriftenreihe: | Lecture notes in computer science
6681 |
Schlagworte: | |
Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
Beschreibung: | Literaturangaben |
Beschreibung: | XIII, 390 S. graph. Darst. 24 cm |
ISBN: | 9783642212031 3642212034 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV037413239 | ||
003 | DE-604 | ||
005 | 20110817 | ||
007 | t | ||
008 | 110523s2011 d||| |||| 10||| eng d | ||
015 | |a 11,N20 |2 dnb | ||
016 | 7 | |a 1011288400 |2 DE-101 | |
020 | |a 9783642212031 |c kart. : ca. EUR 66.34 (DE) (freier Pr.), ca. sfr 89.00 (freier Pr.) |9 978-3-642-21203-1 | ||
020 | |a 3642212034 |9 3-642-21203-4 | ||
024 | 3 | |a 9783642212031 | |
028 | 5 | 2 | |a Best.-Nr.: 80062687 |
035 | |a (OCoLC)844921404 | ||
035 | |a (DE-599)DNB1011288400 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-706 |a DE-11 |a DE-91G |a DE-83 | ||
082 | 0 | |a 004.0151 |2 22/ger | |
084 | |a SS 4800 |0 (DE-625)143528: |2 rvk | ||
084 | |a MAT 913f |2 stub | ||
084 | |a 004 |2 sdnb | ||
084 | |a DAT 530f |2 stub | ||
245 | 1 | 0 | |a Frontiers in algorithmics and algorithmic aspects in information and management |b joint international conference, FAW AAIM 2011, Jinhua, China, May 28 - 31, 2011 ; proceedings |c Mikhail Atallah ... (eds.) |
264 | 1 | |a Berlin [u.a.] |b Springer |c 2011 | |
300 | |a XIII, 390 S. |b graph. Darst. |c 24 cm | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Lecture notes in computer science |v 6681 | |
500 | |a Literaturangaben | ||
650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-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 2011 |z Jinhua |2 gnd-content | |
689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 1 | 1 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
689 | 1 | 2 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
689 | 1 | |5 DE-604 | |
700 | 1 | |a Atallah, Mikhail J. |d 1953- |e Sonstige |0 (DE-588)124390447 |4 oth | |
711 | 2 | |a FAW |n 5 |d 2011 |c Jinhua |j Sonstige |0 (DE-588)16157538-9 |4 oth | |
711 | 2 | |a AAIM |n 7 |d 2011 |c Jinhua |j Sonstige |0 (DE-588)16157659-X |4 oth | |
830 | 0 | |a Lecture notes in computer science |v 6681 |w (DE-604)BV000000607 |9 6681 | |
856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3713537&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=022565647&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-022565647 |
Datensatz im Suchindex
_version_ | 1805096034363244544 |
---|---|
adam_text |
IMAGE 1
TABLE OF CONTENTS
INVITED LECTURES PROGRESS IN COMPLEXITY OF COUNTING PROBLEMS 1
JIN-YI CAI
RECENT DEVELOPMENTS IN THE THEORY OF PRE-PROCESSING 4
MICHAEL R. FELLOWS
RECENT DEVELOPMENTS IN THE MECHANISM DESIGN PROBLEM FOR SCHEDULING 6
ELIAS KOUTSOUPIAS
DEGREE-DRIVEN DESIGN FOR CORRECT GEOMETRIC ALGORITHMS 8 JACK SNOEYINK
CONTRIBUTED PAPERS
A P P R O X I M A T I ON A L G O R I T HM FOR T HE U N I F O RM B O U N
D ED FACILITY P R O B L E M . . 10
KERUI WENG
THE K-CANADIAN TRAVELERS PROBLEM WITH COMMUNICATION 17 HUILI ZHANG AND
YINFENG XU
AN IMPROVED COMPETITIVE ALGORITHM FOR ONE-DIMENSIONAL INCREMENTAL MEDIAN
PROBLEM 29
WENQIANG DAI AND YI FENG
APPROXIMATION SCHEME FOR SCHEDULING RESUMABLE PROPORTIONALLY
DETERIORATING JOBS 36
WENCHANG LUO AND LIN CHEN
AN IMPROVED APPROXIMATION ALGORITHM FOR THE COMPLEMENTARY MAXIMAL STRIP
RECOVERY PROBLEM 46
ZHONG LI, RANDY GOEBEL, LUSHENG WANG, AND GUOHUI LIN
GREEDY ROUTING VIA EMBEDDING GRAPHS ONTO SEMI-METRIC SPACES 58 HUAMING
ZHANG AND SWETHA GOVINDAIAH
ON VARIANTS OF THE SPANNING STAR FOREST PROBLEM 70
JING HE AND HONGYU LIANG
AN IMPLICIT DEGREE CONDITION FOR CYCLABILITY IN GRAPHS 82
HAO LI, WANTAO NING, AND JUNQING CAI
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1011288400
DIGITALISIERT DURCH
IMAGE 2
XII TABLE OF CONTENTS
PARALLEL ENUMERATION OF LATTICE ANIMALS 90
GADI ALEKSANDROWICZ AND GILL BAREQUET
PARAMETERIZED EDGE DOMINATING SET IN CUBIC GRAPHS (EXTENDED ABSTRACT)
100
MINGYU XIAO AND HIROSHI NAGAMOCHI
ON SOME GEOMETRIC PROBLEMS OF COLOR-SPANNING SETS 113
CHENGLIN FAN, WENQI JU, JUN LUO, AND BINHAI ZHU
APPROXIMATION ALGORITHMS FOR CUTTING A CONVEX POLYHEDRON OUT OF A SPHERE
125
XUEHOU TAN AND GANGSHAN WU
AN ALGORITHM FOR OPTIMAL ACYCLIC EDGE-COLOURING OF CUBIC GRAPHS . . .
136 EDITA MDCAJOVD AND JAN MAZDK
COMPLEXITY OF TOTAL {FC}-DOMINATION AND RELATED PROBLEMS 147 JING HE AND
HONGYU LIANG
THE MIN-POWER MULTICAST PROBLEMS IN WIRELESS AD HOC NETWORKS: A
PARAMETERIZED VIEW 156
WEIZHONG LUO, JIANXIN WANG, QILONG FENG, AND JIONG GUO
CONSTANT SUM FLOWS IN REGULAR GRAPHS 168
TAO-MING WANG AND SHI- WEI HU
2D KNAPSACK: PACKING SQUARES 176
MIN CHEN, GYOE'RGY DOSA, XIN HAN, CHENYANG ZHOU, AND ATTILA BENKO
TIGHT APPROXIMATION BOUNDS FOR GREEDY FRUGAL COVERAGE ALGORITHMS 185
IOANNIS CARAGIANNIS, CHRISTOS KAKLAMANIS, AND MARIA KYROPOULOU
ALGORITHMS FOR INTERVAL STRUCTURES WITH APPLICATIONS 196
DANNY Z. CHEN AND EWA MISIOLEK
SINGLE MACHINE SCHEDULING WITH AN OPERATOR NON-AVAILABILITY PERIOD TO
MINIMIZE TOTAL COMPLETION TIME 208
YONG CHEN, AN ZHANG, AND ZHIYI TAN
PSAEC: AN IMPROVED ALGORITHM FOR SHORT READ ERROR CORRECTION USING
PARTIAL SUFFIX ARRAYS 220
ZHIHENG ZHAO, JIANPING YIN, YUBIN ZHAN, WEI XIONG, YONG LI, AND FAYAO
LIU
TWO HARDNESS RESULTS ON FEEDBACK VERTEX SETS 233
WEI JIANG, TIAN LIU, TIENAN REN, AND KE XU
IMAGE 3
TABLE OF CONTENTS XIII
APPROXIMATION ALGORITHMS FOR UNRELATED MACHINE SCHEDULING WITH AN ENERGY
BUDGET 244
LIN CHEN, WENCHANG LUO, AND GUOCHUAN ZHANG
PLANE-FILLING PROPERTIES OF DIRECTED FIGURES 255
WLODZIMIERZ MOCZURAD
AN ITERATIVE METHOD FOR GENERATING LOOP INVARIANTS 264
SHIKUN CHEN, ZHOUJUN LI, XIAOYU SONG, AND MENGJUN LI
ALGORITHMS FOR COMPUTING BIDIRECTIONAL BEST HIT R-WINDOW GENE CLUSTERS
275
TRONG DAO LE, MELVIN ZHANG, AND HON WAI LEONG
CONTRACTED WEBGRAPHS: STRUCTURE MINING AND SCALE-FREENESS 287 YUSHI UNO
AND FUMIYA OGURI
HARDNESS OF FINDING TWO EDGE-DISJOINT MIN-MIN PATHS IN DIGRAPHS . . .
300 LONGKUN GUO AND HONG SHEN
ONLINE ALGORITHM FOR 1-SPACE BOUNDED MULTI-DIMENSIONAL BIN PACKING 308
YONG ZHANG, FRANCIS Y.L. CHIN, HING-FUNG TING, XIN HAN, AND ZHUO CHANG
ONLINE ALGORITHMS FOR MAXIMIZING WEIGHTED THROUGHPUT OF UNIT JOBS WITH
TEMPERATURE CONSTRAINTS 319
MARTIN BIRKS, DANIEL COLE, STANLEY P. Y. FUNG, AND HUICHAO XUE
TEMPERATURE AWARE ONLINE ALGORITHMS FOR SCHEDULING EQUAL LENGTH JOBS 330
MARTIN BIRKS AND STANLEY P. Y. FUNG
VISIBILITY TESTING AND COUNTING 343
SHARAREH ALIPOUR AND ALIREZA ZAREI
THE NEAREST NEIGHBOR SPEARMAN FOOTRULE DISTANCE FOR BUCKET, INTERVAL,
AND PARTIAL ORDERS 352
FRANZ J. BRANDENBURG, ANDREAS GLEISSNER, AND ANDREAS HOFMEIER
MINIMUM WIDTH RECTANGULAR ANNULUS 364
JOYDEEP MUKHERJEE, PRIYA RANJAN SINHA MAHAPATRA, ARINDAM KARMAKAR, AND
SANDIP DAS
AN EXPERIMENTAL STUDY ON GENERATING PLANAR GRAPHS 375
SASCHA MEINERT AND DOROTHEA WAGNER
AUTHOR INDEX 389 |
any_adam_object | 1 |
author_GND | (DE-588)124390447 |
building | Verbundindex |
bvnumber | BV037413239 |
classification_rvk | SS 4800 |
classification_tum | MAT 913f DAT 530f |
ctrlnum | (OCoLC)844921404 (DE-599)DNB1011288400 |
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 Mathematik |
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">BV037413239</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110817</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">110523s2011 d||| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">11,N20</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1011288400</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642212031</subfield><subfield code="c">kart. : ca. EUR 66.34 (DE) (freier Pr.), ca. sfr 89.00 (freier Pr.)</subfield><subfield code="9">978-3-642-21203-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642212034</subfield><subfield code="9">3-642-21203-4</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642212031</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 80062687</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)844921404</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1011288400</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-706</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</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">MAT 913f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</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 2011, Jinhua, China, May 28 - 31, 2011 ; proceedings</subfield><subfield code="c">Mikhail Atallah ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 390 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">24 cm</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">6681</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-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">2011</subfield><subfield code="z">Jinhua</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2="1"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Atallah, Mikhail J.</subfield><subfield code="d">1953-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)124390447</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">FAW</subfield><subfield code="n">5</subfield><subfield code="d">2011</subfield><subfield code="c">Jinhua</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16157538-9</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">AAIM</subfield><subfield code="n">7</subfield><subfield code="d">2011</subfield><subfield code="c">Jinhua</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16157659-X</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">6681</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">6681</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=3713537&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=022565647&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-022565647</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 2011 Jinhua gnd-content |
genre_facet | Konferenzschrift 2011 Jinhua |
id | DE-604.BV037413239 |
illustrated | Illustrated |
indexdate | 2024-07-20T11:08:45Z |
institution | BVB |
institution_GND | (DE-588)16157538-9 (DE-588)16157659-X |
isbn | 9783642212031 3642212034 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-022565647 |
oclc_num | 844921404 |
open_access_boolean | |
owner | DE-706 DE-11 DE-91G DE-BY-TUM DE-83 |
owner_facet | DE-706 DE-11 DE-91G DE-BY-TUM DE-83 |
physical | XIII, 390 S. graph. Darst. 24 cm |
publishDate | 2011 |
publishDateSearch | 2011 |
publishDateSort | 2011 |
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 2011, Jinhua, China, May 28 - 31, 2011 ; proceedings Mikhail Atallah ... (eds.) Berlin [u.a.] Springer 2011 XIII, 390 S. graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 6681 Literaturangaben Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2011 Jinhua gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 Algorithmus (DE-588)4001183-5 s Berechnungskomplexität (DE-588)4134751-1 s Kombinatorische Optimierung (DE-588)4031826-6 s Atallah, Mikhail J. 1953- Sonstige (DE-588)124390447 oth FAW 5 2011 Jinhua Sonstige (DE-588)16157538-9 oth AAIM 7 2011 Jinhua Sonstige (DE-588)16157659-X oth Lecture notes in computer science 6681 (DE-604)BV000000607 6681 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3713537&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=022565647&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 2011, Jinhua, China, May 28 - 31, 2011 ; proceedings Lecture notes in computer science Theoretische Informatik (DE-588)4196735-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4196735-5 (DE-588)4031826-6 (DE-588)4134751-1 (DE-588)4001183-5 (DE-588)1071861417 |
title | Frontiers in algorithmics and algorithmic aspects in information and management joint international conference, FAW AAIM 2011, Jinhua, China, May 28 - 31, 2011 ; proceedings |
title_auth | Frontiers in algorithmics and algorithmic aspects in information and management joint international conference, FAW AAIM 2011, Jinhua, China, May 28 - 31, 2011 ; proceedings |
title_exact_search | Frontiers in algorithmics and algorithmic aspects in information and management joint international conference, FAW AAIM 2011, Jinhua, China, May 28 - 31, 2011 ; proceedings |
title_full | Frontiers in algorithmics and algorithmic aspects in information and management joint international conference, FAW AAIM 2011, Jinhua, China, May 28 - 31, 2011 ; proceedings Mikhail Atallah ... (eds.) |
title_fullStr | Frontiers in algorithmics and algorithmic aspects in information and management joint international conference, FAW AAIM 2011, Jinhua, China, May 28 - 31, 2011 ; proceedings Mikhail Atallah ... (eds.) |
title_full_unstemmed | Frontiers in algorithmics and algorithmic aspects in information and management joint international conference, FAW AAIM 2011, Jinhua, China, May 28 - 31, 2011 ; proceedings Mikhail Atallah ... (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 2011 jinhua china may 28 31 2011 proceedings |
title_sub | joint international conference, FAW AAIM 2011, Jinhua, China, May 28 - 31, 2011 ; proceedings |
topic | Theoretische Informatik (DE-588)4196735-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd |
topic_facet | Theoretische Informatik Kombinatorische Optimierung Berechnungskomplexität Algorithmus Konferenzschrift 2011 Jinhua |
url | http://deposit.dnb.de/cgi-bin/dokserv?id=3713537&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=022565647&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV000000607 |
work_keys_str_mv | AT atallahmikhailj frontiersinalgorithmicsandalgorithmicaspectsininformationandmanagementjointinternationalconferencefawaaim2011jinhuachinamay28312011proceedings AT fawjinhua frontiersinalgorithmicsandalgorithmicaspectsininformationandmanagementjointinternationalconferencefawaaim2011jinhuachinamay28312011proceedings AT aaimjinhua frontiersinalgorithmicsandalgorithmicaspectsininformationandmanagementjointinternationalconferencefawaaim2011jinhuachinamay28312011proceedings |