Algorithms and computation: 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings
Saved in:
| Format: | Conference Proceeding Book |
|---|---|
| Language: | English |
| Published: |
Berlin [u.a.]
Springer
2011
|
| Series: | Lecture notes in computer science
6552 |
| Subjects: | |
| Online Access: | Inhaltstext Inhaltsverzeichnis |
| Item Description: | Literaturangaben |
| Physical Description: | XI, 232 S. graph. Darst. 24 cm |
| ISBN: | 9783642190933 |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV037238040 | ||
| 003 | DE-604 | ||
| 005 | 20110413 | ||
| 007 | t| | ||
| 008 | 110221s2011 xx d||| |||| 10||| eng d | ||
| 016 | 7 | |a 100938791X |2 DE-101 | |
| 020 | |a 9783642190933 |9 978-3-642-19093-3 | ||
| 035 | |a (OCoLC)711828637 | ||
| 035 | |a (DE-599)DNB100938791X | ||
| 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 004 |2 sdnb | ||
| 084 | |a 510 |2 sdnb | ||
| 084 | |a DAT 530f |2 stub | ||
| 245 | 1 | 0 | |a Algorithms and computation |b 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings |c Naoki Katoh ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2011 | |
| 300 | |a XI, 232 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 6552 | |
| 500 | |a Literaturangaben | ||
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |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 Algorithmische Geometrie |0 (DE-588)4130267-9 |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 Delhi |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 | |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Katoh, Naoki |e Sonstige |0 (DE-588)143544543 |4 oth | |
| 711 | 2 | |a WALCOM |n 5 |d 2011 |c Delhi |j Sonstige |0 (DE-588)16101196-2 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 6552 |w (DE-604)BV000000607 |9 6552 | |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3647586&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=021151586&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-021151586 | |
Record in the Search Index
| _version_ | 1820875294385373184 |
|---|---|
| adam_text |
IMAGE 1
TABLE OF CONTENTS
INVITED TALKS GEOMETRY AND TOPOLOGY FROM POINT CLOUD DATA 1
TAMAL KRISHNA DEY
THE DISJOINT PATHS PROBLEM: ALGORITHM AND STRUCTURE 2
KEN-ICHI KAWARABAYASHI
THE PHYSARUM COMPUTER 8
KURT MEHLHORN
APPROXIMATION ALGORITHMS
MAXIMUM BETWEENNESS CENTRALITY: APPROXIMABILITY AND TRACTABLE CASES 9
MARTIN FINK AND JOACHIM SPOERHASE
APPROXIMATION ALGORITHMS FOR MINIMUM CHAIN VERTEX DELETION 21 MRINAL
KUMAR, SOUNAKA MISHRA, N. SAFINA DEVI, AND SAKET SAURABH
OBLIVIOUS BUY-AT-BULK IN PLANAR GRAPHS 33
SRIVATHSAN SRINIVASAGOPALAN, COSTAS BUSCH, AND S. SITHARAMA IYENGAR
HARDNESS
THE COMPLEXITY OF ACYCLIC SUBHYPERGRAPH PROBLEMS 45
DAVID DURIS AND YANN STROZECKI
INAPPROXIMABILITY OF 6-MATCHING IN FC-UNIFORM HYPERGRAPHS 57 MOURAD EL
OUALI, ANTJE FRETWURST, AND ANAND SRIVASTAV
FC-LEVEL CROSSING MINIMIZATION IS NP-HARD FOR TREES 70
MARTIN HARRIGAN AND PATRICK HEALY
ALGORITHM ENGINEERING
EFFICIENT COMPUTATION OF TIME-DEPENDENT CENTRALITIES IN AIR
TRANSPORTATION NETWORKS 77
ANNABELL BERGER, MATTHIAS MUELLER-HANNEMANN, STEFFEN RECHNER, AND
ALEXANDER ZOCK
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/100938791X
DIGITALISIERT DURCH
IMAGE 2
X TABLE OF CONTENTS
ANALYSIS OF GAUSS-SIEVE FOR SOLVING THE SHORTEST VECTOR PROBLEM IN
LATTICES 89
MICHAEL SCHNEIDER
COMPUTATIONAL GEOMETRY
MINIMUM ENCLOSING CIRCLE OF A SET OF FIXED POINTS AND A MOBILE POINT 98
ARITRA BANIK, BHASWAR B. BHATTACHARYA, AND SANDIP DAS
EFFICIENT TOP-A; QUERIES FOR ORTHOGONAL RANGES 110
SALADI RAHUL, PROSENJIT GUPTA, RAVI JANARDAN, AND K.S. RAJAN
RANGE-AGGREGATE QUERIES INVOLVING GEOMETRIC AGGREGATION OPERATIONS 122
SALADI RAHUL, ANANDA SWARUP DAS, K.S. RAJAN, AND KANNAN SRINATHAN
APPROXIMATION ALGORITHMS
MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS 134
A. KARIM ABU-AFFASH, PAZ CARMI, MATTHEW J. KATZ, AND GILA MORGENSTERN
ON THE DISCRETE UNIT DISK COVER PROBLEM 146
GAUTAM K. DAS, ROBERT FRAESER, ALEJANDRO LOPEZ-ORTIZ, AND BRADFORD G.
NICKERSON
CLUSTERING WITH INTERNAL CONNECTEDNESS 158
NEELIMA GUPTA, ADITYA PANCHOLI, AND YOGISH SABHARWAL
STRING ALGORITHMS
HASHED PATRICIA TRIE: EFFICIENT LONGEST PREFIX MATCHING IN PEER-TO-PEER
SYSTEMS 170
SEBASTIAN KNIESBURGES AND CHRISTIAN SCHEIDELER
DE BRUIJN SEQUENCES FOR THE BINARY STRINGS WITH MAXIMUM DENSITY . . .
182 JOE SAWADA, BRETT STEVENS, AND AARON WILLIAMS
GRAPH ALGORITHMS
A POLYNOMIAL TIME ALGORITHM FOR LONGEST PATHS IN BICONVEX GRAPHS. 191
ESHA GHOSH, N.S. NARAYANASWAMY, AND C. PANDU RANGAN
COUNTING SPANNING TREES IN GRAPHS USING MODULAR DECOMPOSITION 202
STAVROS D. NIKOLOPOULOS, LEONIDAS PALIOS, AND CHARIS PAPADOPOULOS
IMAGE 3
TABLE OF CONTENTS XI
ON GRACEFUL LABELINGS OF TREES (EXTENDED ABSTRACT) 214
SOURABH ARYABHATTA, TONMOY GUHA ROY, MD. MOHSIN UDDIN, AND MD. SAIDUR
RAHMAN
MINIMUM-LAYER DRAWINGS OF TREES (EXTENDED ABSTRACT) 221
DEBAJYOTI MONDAL, MUHAMMAD JAWAHERUL ALAM, AND MD. SAIDUR RAHMAN
AUTHOR INDEX 233 |
| any_adam_object | 1 |
| author_GND | (DE-588)143544543 |
| building | Verbundindex |
| bvnumber | BV037238040 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 530f |
| ctrlnum | (OCoLC)711828637 (DE-599)DNB100938791X |
| 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">BV037238040</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110413</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">110221s2011 xx d||| |||| 10||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">100938791X</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642190933</subfield><subfield code="9">978-3-642-19093-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)711828637</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB100938791X</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">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</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">Algorithms and computation</subfield><subfield code="b">5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings</subfield><subfield code="c">Naoki Katoh ... (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">XI, 232 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">6552</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</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">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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">Delhi</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Katoh, Naoki</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)143544543</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">WALCOM</subfield><subfield code="n">5</subfield><subfield code="d">2011</subfield><subfield code="c">Delhi</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16101196-2</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">6552</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">6552</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=3647586&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=021151586&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-021151586</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2011 Delhi gnd-content |
| genre_facet | Konferenzschrift 2011 Delhi |
| id | DE-604.BV037238040 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:13:19Z |
| institution | BVB |
| institution_GND | (DE-588)16101196-2 |
| isbn | 9783642190933 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-021151586 |
| oclc_num | 711828637 |
| 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 | XI, 232 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 | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings Naoki Katoh ... (eds.) Berlin [u.a.] Springer 2011 XI, 232 S. graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 6552 Literaturangaben Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2011 Delhi gnd-content Algorithmus (DE-588)4001183-5 s Komplexitätstheorie (DE-588)4120591-1 s DE-604 Algorithmische Geometrie (DE-588)4130267-9 s Approximationsalgorithmus (DE-588)4500954-5 s Katoh, Naoki Sonstige (DE-588)143544543 oth WALCOM 5 2011 Delhi Sonstige (DE-588)16101196-2 oth Lecture notes in computer science 6552 (DE-604)BV000000607 6552 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3647586&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=021151586&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings Lecture notes in computer science Approximationsalgorithmus (DE-588)4500954-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4500954-5 (DE-588)4120591-1 (DE-588)4130267-9 (DE-588)4001183-5 (DE-588)1071861417 |
| title | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings |
| title_auth | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings |
| title_exact_search | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings |
| title_full | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings Naoki Katoh ... (eds.) |
| title_fullStr | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings Naoki Katoh ... (eds.) |
| title_full_unstemmed | Algorithms and computation 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings Naoki Katoh ... (eds.) |
| title_short | Algorithms and computation |
| title_sort | algorithms and computation 5th international workshop walcom 2011 new delhi india february 18 20 2011 proceedings |
| title_sub | 5th international workshop, WALCOM 2011, New Delhi, India, February 18 - 20, 2011 ; proceedings |
| topic | Approximationsalgorithmus (DE-588)4500954-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Approximationsalgorithmus Komplexitätstheorie Algorithmische Geometrie Algorithmus Konferenzschrift 2011 Delhi |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3647586&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=021151586&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT katohnaoki algorithmsandcomputation5thinternationalworkshopwalcom2011newdelhiindiafebruary18202011proceedings AT walcomdelhi algorithmsandcomputation5thinternationalworkshopwalcom2011newdelhiindiafebruary18202011proceedings |