Verfügbarkeit: Algorithms and computation

Algorithms and computation: 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5 - 8, 2011 ; proceedings

Gespeichert in:

Bibliographische Detailangaben
Format:	Tagungsbericht Buch
Sprache:	English
Veröffentlicht:	Berlin [u.a.] Springer 2011
Schriftenreihe:	Lecture notes in computer science 7074
Schlagworte:	Datenstruktur Kombinatorische Optimierung Algorithmische Geometrie Berechnungskomplexität Algorithmus Konferenzschrift > 2011 > Yokohama
Online-Zugang:	Inhaltstext Inhaltsverzeichnis
Beschreibung:	Literaturangaben
Beschreibung:	XVII, 775 S. graph. Darst. 24 cm
ISBN:	9783642255908 3642255906 9783642255915

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV039739766
003	DE-604
005	20111213
007	t\|
008	111205s2011 xx d\|\|\| \|\|\|\| 10\|\|\| eng d
015			\|a 11,N44 \|2 dnb
016	7		\|a 1016561725 \|2 DE-101
020			\|a 9783642255908 \|c kart. : ca. EUR 93.09 (DE) (freier Pr.), ca. EUR 95.70 (AT) (freier Pr.), ca. sfr 116.00 (freier Pr.) \|9 978-3-642-25590-8
020			\|a 3642255906 \|9 3-642-25590-6
020			\|a 9783642255915 \|c Online \|9 978-3-642-25591-5
024	3		\|a 9783642255908
028	5	2	\|a Best.-Nr.: 86008673
035			\|a (OCoLC)762993612
035			\|a (DE-599)DNB1016561725
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-706 \|a DE-83 \|a DE-91G \|a DE-11
082	0		\|a 004.015118 \|2 22/ger
084			\|a 004 \|2 sdnb
084			\|a DAT 530f \|2 stub
245	1	0	\|a Algorithms and computation \|b 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5 - 8, 2011 ; proceedings \|c Takao Asano ... (eds.)
264		1	\|a Berlin [u.a.] \|b Springer \|c 2011
300			\|a XVII, 775 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 7074 : Advanced research in computing and software science
500			\|a Literaturangaben
650	0	7	\|a Datenstruktur \|0 (DE-588)4011146-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 Algorithmische Geometrie \|0 (DE-588)4130267-9 \|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 Yokohama \|2 gnd-content
689	0	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|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 Berechnungskomplexität \|0 (DE-588)4134751-1 \|D s
689	2		\|5 DE-604
689	3	0	\|a Datenstruktur \|0 (DE-588)4011146-5 \|D s
689	3		\|5 DE-604
689	4	0	\|a Kombinatorische Optimierung \|0 (DE-588)4031826-6 \|D s
689	4		\|5 DE-604
700	1		\|a Asano, Takao \|d 1949- \|e Sonstige \|0 (DE-588)121131580 \|4 oth
711	2		\|a ISAAC \|n 22 \|d 2011 \|c Yokohama \|j Sonstige \|0 (DE-588)16331860-8 \|4 oth
776	0	8	\|i Erscheint auch als \|n Online-Ausgabe \|t Algorithms and Computation
830		0	\|a Lecture notes in computer science \|v 7074 \|w (DE-604)BV000000607 \|9 7074
856	4	2	\|m X:MVB \|q text/html \|u http://deposit.dnb.de/cgi-bin/dokserv?id=3902795&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=024587477&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
943	1		\|a oai:aleph.bib-bvb.de:BVB01-024587477

Datensatz im Suchindex

_version_	1820875362191540224
adam_text	IMAGE 1 TABLE OF CONTENTS INVITED TALK I ALGORITHM ENGINEERING FOR ROUTE PLANNING: AN UPDATE 1 DOROTHEA WAGNER INVITED TALK II SEMIDEFINITE PROGRAMMING AND APPROXIMATION ALGORITHMS: A S U R V E Y . . 6 SANJEEV ARORA APPROXIMATION ALGORITHMS I THE SCHOOL BUS PROBLEM ON TREES 10 ADRIAN BOCK, ELYOT GRANT, JOCHEN KOENEMANN, AND LAURA SANITA IMPROVED APPROXIMATIONS FOR BUY-AT-BULK AND SHALLOW-LIGHT FC-STEINER TREES AND (FC, 2)-SUBGRAPH 20 M. REZA KHANI AND MOHAMMAD R. SALAVATIPOUR IMPROVED APPROXIMATION ALGORITHMS FOR ROUTING SHOP SCHEDULING 30 WEI YU AND GUOCHUAN ZHANG CONTRACTION-BASED STEINER TREE APPROXIMATIONS IN PRACTICE 40 MARKUS CHIMANI AND MATTHIAS WOSTE COMPUTATIONAL GEOMETRY I COVERING AND PIERCING DISKS WITH TWO CENTERS 50 HEE-KAP AHN, SANG-SUB KIM, CHRISTIAN KNAUER, LENA SCHLIPF, CHAN-SU SHIN, AND ANTOINE VIGNERON GENERATING REALISTIC ROOFS OVER A RECTILINEAR POLYGON 60 HEE-KAP AHN, SANG WON BAE, CHRISTIAN KNAUER, MIRA LEE, CHAN-SU SHIN, AND ANTOINE VIGNERON COMPUTING THE VISIBILITY POLYGON USING FEW VARIABLES 70 LUIS BARBA, MATIAS KORMAN, STEFAN LANGERMAN, AND RODRIGO I. SILVEIRA MINIMIZING INTERFERENCE IN AD-HOC NETWORKS WITH BOUNDED COMMUNICATION RADIUS 80 MATIAS KORMAN BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1016561725 DIGITALISIERT DURCH IMAGE 2 XII TABLE OF CONTENTS GRAPH ALGORITHMS HAMILTONIAN PATHS IN THE SQUARE OF A TREE 90 JAKUB RADOSZEWSKI AND WOJDECH RYTTER DOMINATING INDUCED MATCHINGS FOR F7-FREE GRAPHS IN LINEAR TIME 100 ANDREAS BRANDSTAEDT AND RAFFAELE MOSCA FINDING CONTRACTIONS AND INDUCED MINORS IN CHORDAL GRAPHS VIA DISJOINT PATHS 110 REMY BELMONTE, PETR A. GOLOVACH, PINAR HEGGERNES, PIRN VAN 'T HOF, MARCIN KAMINSKI, AND DANIEL PAULUSMA RECOGNIZING POLAR PLANAR GRAPHS USING NEW RESULTS FOR MONOPOLARITY 120 VAN BANG LE AND RAGNAR NEVRI.ES ROBUSTNESS OF MINIMUM COST ARBORESCENCES 130 NAOYUKI KAMIYAMA DATA STRUCTURES I PATH QUERIES IN WEIGHTED TREES 140 MENG HE, J. IAN MUNRO, AND GELIN ZHOU DYNAMIC RANGE MAJORITY DATA STRUCTURES 150 AMR ELMASRY, MENG HE, J. IAN MUNRO, AND PATRICK K. NICHOLSON DYNAMIC RANGE SELECTION IN LINEAR SPACE 160 MENG HE, J. IAN MUNRO, AND PATRICK K. NICHOLSON A DYNAMIC STABBING-MAX DATA STRUCTURE WITH SUB-LOGARITHMIC QUERY TIME 170 YAKOV NEKRICH ENCODING 2D RANGE MAXIMUM QUERIES 180 MORDECAI GOLIN, JOHN IACONO, DANNY KRIZANC, RAJEEV RAMAN, AND S. SRINIVASA RAO DISTRIBUTED SYSTEMS DIAMETER AND BROADCAST TIME OF RANDOM GEOMETRIC GRAPHS IN ARBITRARY DIMENSIONS 190 TOBIAS FRIEDRICH, THOMAS SAUERWALD, AND ALEXANDRE STAUFFER BROADCASTING IN HETEROGENEOUS TREE NETWORKS WITH UNCERTAINTY 200 CHENG-HSIAO TSOU, GEN-HUEY CHEN, AND CHING-CHI LIN IMAGE 3 TABLE OF CONTENTS XIII OPTIMAL FILE DISTRIBUTION IN PEER-TO-PEER NETWORKS 210 KAI-SIMON GOETZMANN, TOBIAS HARKS, MAX KLIMM, AND KONSTANTIN MILLER COMPUTATIONAL GEOMETRY II ANIMAL TESTING 220 ADRIAN DUMITRESCU AND EVAN HILSCHER CUTTING OUT POLYGONS WITH A CIRCULAR SAW 230 ADRIAN DUMITRESCU AND MASUD HASAN FAST FRECHET QUERIES 240 MARK DE BERG, ATLAS F. COOK IV, AND JOACHIM GUDMUNDSSON GRAPH DRAWING AND INFORMATION VISUALIZATION ANGLE-RESTRICTED STEINER ARBORESCENCES FOR FLOW MAP LAYOUT 250 KEVIN BUCHIN, BETTINA SPECKMANN, AND KEVIN VERBEEK TREEMAPS WITH BOUNDED ASPECT RATIO 260 MARK DE BERG, BETTINA SPECKMANN, AND VINCENT VAN DER WEELE SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS 271 PATRIZIO ANGELINI, GIUSEPPE DI BATTISTA, AND FABRIZIO FRATI LINEAR-TIME ALGORITHMS FOR HOLE-FREE RECTILINEAR PROPORTIONAL CONTACT GRAPH REPRESENTATIONS 281 MUHAMMAD JAWAHERUL ALAM, THERESE BIEDL, STEFAN FELSNER, ANDREAS GERASCH, MICHAEL KAUFMANN, AND STEPHEN G. KOBOUROV DATA STRUCTURES II FULLY RETROACTIVE APPROXIMATE RANGE AND NEAREST NEIGHBOR SEARCHING 292 MICHAEL T. GOODRICH AND JOSEPH A. SIMONS COMPACT REPRESENTATION OF POSETS 302 ARASH FARZAN AND JOHANNES FISCHER EXPLICIT ARRAY-BASED COMPACT DATA STRUCTURES FOR TRIANGULATIONS 312 LUCA CASTELLI ALEARDI AND OLIVIER DEVILLERS SPACE-EFFICIENT DATA-ANALYSIS QUERIES ON GRIDS 323 GONZALO NAVARRO AND LUIS M.S. RUSSO IMAGE 4 XIV TABLE OF CONTENTS PARAMETERIZED ALGORITHMS I A POLYNOMIAL KERNEL FOR FEEDBACK ARC SET ON BIPARTITE TOURNAMENTS 333 PRANABENDU MISRA, VENKATESH RAMAN, M.S. RAMANUJAN, AND SAKET SAURABH FIXED-PARAMETER COMPLEXITY OF FEEDBACK VERTEX SET IN BIPARTITE TOURNAMENTS 344 SHENG-YING HSIAO PARAMETERIZED ALGORITHMS FOR INCLUSION OF LINEAR MATCHINGS 354 SYLVAIN GUILLEMOT COMPUTATIONAL STUDY ON BIDIMENSIONALITY THEORY BASED ALGORITHM FOR LONGEST PATH PROBLEM 364 CHUNHAO WANG AND QIAN-PING GU PARALLEL AND EXTERNAL MEMORY ALGORITHMS SORTING, SEARCHING, AND SIMULATION IN THE MAPREDUCE FRAMEWORK 374 MICHAEL T. GOODRICH, NODARI SITCHINAVA, AND QIN ZHANG EXTERNAL-MEMORY MULTIMAPS 384 ELAINE ANGELINO, MICHAEL T. GOODRICH, MICHAEL MITZENMACHER, AND JUSTIN THALER EXTERNAL MEMORY ORTHOGONAL RANGE REPORTING WITH FAST UPDATES 395 YAKOV NEKRICH ANALYSIS OF SPEEDUPS IN PARALLEL EVOLUTIONARY ALGORITHMS FOR COMBINATORIAL OPTIMIZATION (EXTENDED ABSTRACT) 405 JOERG LAESSIG AND DIRK SUDHOLT GAME THEORY AND INTERNET ALGORITHMS VERIFYING NASH EQUILIBRIA IN PAGERANK GAMES ON UNDIRECTED WEB GRAPHS 415 DAVID AVIS, KAZUO IWAMA, AND DAICHI PAKU IMPROVED COLLABORATIVE FILTERING 425 AVIV NISGAV AND BOAZ PATT-SHAMIR ASYMPTOTIC MODULARITY OF SOME GRAPH CLASSES 435 FABIEN DE MONTGOLFIER, MAURICIO SOTO, AND LAURENT VIENNOT IMAGE 5 TABLE OF CONTENTS XV COMPUTATIONAL COMPLEXITY PROGRAM SIZE AND TEMPERATURE IN SELF-ASSEMBLY 445 HO-LIN CHEN, DAVID DOTY, AND SHINNOSUKE SEKI OPTIMIZATION, RANDOMIZED APPROXIMABILITY, AND BOOLEAN CONSTRAINT SATISFACTION PROBLEMS 454 TOMOYUKI YAMAKAMI LOWER BOUNDS FOR MYOPIC DPLL ALGORITHMS WITH A CUT HEURISTIC 464 DMITRY ITSYKSON AND DMITRY SOKOLOV APPROXIMATION ALGORITHMS II ALGORITHM FOR SINGLE ALLOCATION PROBLEM ON HUB-AND-SPOKE NETWORKS IN 2-DIMENSIONAL PLANE 474 RYUTA ANDO AND TOMOMI MATSUI PACKING-BASED APPROXIMATION ALGORITHM FOR THE FC-SET COVER PROBLEM 484 MARTIN FUERER AND HUIWEN YU CAPACITATED DOMINATION: CONSTANT FACTOR APPROXIMATIONS FOR PLANAR GRAPHS 494 MONG-JEN KAO AND D. T. LEE RANDOMIZED ALGORITHMS ON POWER-LAW DISTRIBUTED BALLS IN BINS AND ITS APPLICATIONS TO VIEW SIZE ESTIMATION 504 IOANNIS ATSONIOS, OLIVIER BEAUMONT, NICOLAS HANUSSE, AND YUSIK KIM A RANDOMIZED ALGORITHM FOR FINDING FREQUENT ELEMENTS IN STREAMS USING O(LOGLOG N) SPACE 514 MASATORA OGATA, YUKIKO YAMAUCHI, SHUJI KIJIMA, AND MASAFUMI YAMASHITA A NEARLY-QUADRATIC GAP BETWEEN ADAPTIVE AND NON-ADAPTIVE PROPERTY TESTERS (EXTENDED ABSTRACT) 524 JEREMY HURWITZ ONLINE AND STREAMING ALGORITHMS ONLINE LINEAR OPTIMIZATION OVER PERMUTATIONS 534 SHOTA YASUTAKE, KOHEI HATANO, SHUJI KIJIMA, EIJI TAKIMOTO, AND MASAYUKI TAKEDA IMAGE 6 XVI TABLE OF CONTENTS ON THE BEST POSSIBLE COMPETITIVE RATIO FOR MULTISLOPE SKI RENTAL 544 HIROSHI FUJIWARA, TAKUMA KITANO, AND TOSHIHIRO FUJITO INPUT-THRIFTY EXTREMA TESTING 554 KUAN-CHIEH ROBERT TSENG AND DAVID KIRKPATRICK EDIT DISTANCE TO MONOTONICITY IN SLIDING WINDOWS 564 HO-LEUNG CHAN, TAK-WAH LAM, LAP-KEI LEE, JIANGWEI PAN, HING-FUNG TING, AND QIN ZHANG COMPUTATIONAL GEOMETRY III FOLDING EQUILATERAL PLANE GRAPHS 574 ZACHARY ABEL, ERIK D. DEMAINE, MARTIN L. DEMAINE, SARAH EISENSTAT, JAYSON LYNCH, TAO B. SCHARDL, AND ISAAC SHAPIRO-ELLOWITZ EFFICIENT ALGORITHMS FOR THE WEIGHTED FC-CENTER PROBLEM ON A REAL LINE 584 DANNY Z. CHEN AND HAITAO WANG OUTLIER RESPECTING POINTS APPROXIMATION 594 DANNY Z. CHEN AND HAITAO WANG AN IMPROVED ALGORITHM FOR RECONSTRUCTING A SIMPLE POLYGON FROM THE VISIBILITY ANGLES 604 DANNY Z. CHEN AND HAITAO WANG PARAMETERIZED ALGORITHMS II THE PARAMETERIZED COMPLEXITY OF LOCAL SEARCH FOR TSP, MORE REFINED 614 JIONG GUO, SEPP HAERTUNG, ROLF NIEDERMEIER, AND ONDFEJ SUCHY ON THE PARAMETERIZED COMPLEXITY OF CONSENSUS CLUSTERING 624 MARTIN DOERNFELDER, JIONG GUO, CHRISTIAN KOMUSIEWICZ, AND MATHIAS WELLER TWO FIXED-PARAMETER ALGORITHMS FOR THE COCOLORING PROBLEM 634 VICTOR CAMPOS, SULAMITA KLEIN, RUDINI SAMPAIO, AND ANA SILVA PARAMETERIZED COMPLEXITY OF THE FIREFIGHTER PROBLEM 643 CRISTINA BAZGAN, MORGAN CHOPIN, AND MICHAEL R. FELLOWS IMAGE 7 TABLE OF CONTENTS XVII STRING ALGORITHMS FASTER APPROXIMATE PATTERN MATCHING IN COMPRESSED REPETITIVE TEXTS 653 TRAVIS GAGIE, PAWEL GAWRYCHOWSKI, AND SIMON J. PUGLISI A NEW ALGORITHM FOR THE CHARACTERISTIC STRING PROBLEM UNDER LOOSE SIMILARITY CRITERIA 663 YOSHIFUMI SAKAI SUCCINCT INDEXES FOR CIRCULAR PATTERNS 673 WING-KAI HON, CHEN-HUA LU, RAHUL SHAH, AND SHARMA V. THANKACHAN RANGE LCP 683 AMIHOOD AMIR, ALBERTO APOSTOLICO, GAD M. LANDAU, AVIVIT LEVY, MOSHE LEWENSTEIN, AND ELY PORAT OPTIMIZATION COMPUTING KNAPSACK SOLUTIONS WITH CARDINALITY ROBUSTNESS 693 NAONORI KAKIMURA, KAZUHISA MAKINO, AND KENTO SEIMI MAX-THROUGHPUT FOR (CONSERVATIVE) K-OI-N TESTING 703 LISA HELLERSTEIN, OZGUER OZKAN, AND LINDA SELLIE CLOSEST PERIODIC VECTORS IN L P SPACES 714 AMIHOOD AMIR, ESTRELLA EISENBERG, AVIVIT LEVY, AND NOA LEWENSTEIN MAXIMUM WEIGHT DIGITAL REGIONS DECOMPOSABLE INTO DIGITAL STAR-SHAPED REGIONS 724 MATT GIBSON, DONGFENG HAN, MILAN SONKA, AND XIAODONG WU COMPUTATIONAL BIOLOGY FINDING MAXIMUM SUM SEGMENTS IN SEQUENCES WITH UNCERTAINTY 734 HUNG-I YU, TIEN-CHING LIN, AND D.T. LEE ALGORITHMS FOR BUILDING CONSENSUS MUL-TREES 744 YUN CUI, JESPER JANSSON, AND WING-KIN SUNG ADAPTIVE PHENOTYPE TESTING FOR AND/OR ITEMS 754 FRANCIS Y.L. CHIN, HENRY CM. LEUNG, AND S.M. YIU AN INDEX STRUCTURE FOR SPACED SEED SEARCH 764 TAKU ONODERA AND TETSUO SHIBUYA AUTHOR INDEX 773
any_adam_object	1
author_GND	(DE-588)121131580
building	Verbundindex
bvnumber	BV039739766
classification_rvk	SS 4800
classification_tum	DAT 530f
ctrlnum	(OCoLC)762993612 (DE-599)DNB1016561725
dewey-full	004.015118
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	004 - Computer science
dewey-raw	004.015118
dewey-search	004.015118
dewey-sort	14.015118
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">BV039739766</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20111213</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">111205s2011 xx d\|\|\| \|\|\|\| 10\|\|\| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">11,N44</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1016561725</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642255908</subfield><subfield code="c">kart. : ca. EUR 93.09 (DE) (freier Pr.), ca. EUR 95.70 (AT) (freier Pr.), ca. sfr 116.00 (freier Pr.)</subfield><subfield code="9">978-3-642-25590-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642255906</subfield><subfield code="9">3-642-25590-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642255915</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-642-25591-5</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642255908</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 86008673</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)762993612</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1016561725</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-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.015118</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">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">22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5 - 8, 2011 ; proceedings</subfield><subfield code="c">Takao Asano ... (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">XVII, 775 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">7074 : Advanced research in computing and software science</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-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">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">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">Yokohama</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=" "><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">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Asano, Takao</subfield><subfield code="d">1949-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)121131580</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">ISAAC</subfield><subfield code="n">22</subfield><subfield code="d">2011</subfield><subfield code="c">Yokohama</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16331860-8</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="t">Algorithms and Computation</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7074</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">7074</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=3902795&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=024587477&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-024587477</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift 2011 Yokohama gnd-content
genre_facet	Konferenzschrift 2011 Yokohama
id	DE-604.BV039739766
illustrated	Illustrated
indexdate	2025-01-10T15:14:25Z
institution	BVB
institution_GND	(DE-588)16331860-8
isbn	9783642255908 3642255906 9783642255915
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-024587477
oclc_num	762993612
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, 775 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 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5 - 8, 2011 ; proceedings Takao Asano ... (eds.) Berlin [u.a.] Springer 2011 XVII, 775 S. graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 7074 : Advanced research in computing and software science Literaturangaben Datenstruktur (DE-588)4011146-5 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 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 Yokohama gnd-content Algorithmus (DE-588)4001183-5 s DE-604 Algorithmische Geometrie (DE-588)4130267-9 s Berechnungskomplexität (DE-588)4134751-1 s Datenstruktur (DE-588)4011146-5 s Kombinatorische Optimierung (DE-588)4031826-6 s Asano, Takao 1949- Sonstige (DE-588)121131580 oth ISAAC 22 2011 Yokohama Sonstige (DE-588)16331860-8 oth Erscheint auch als Online-Ausgabe Algorithms and Computation Lecture notes in computer science 7074 (DE-604)BV000000607 7074 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3902795&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=024587477&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Algorithms and computation 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5 - 8, 2011 ; proceedings Lecture notes in computer science Datenstruktur (DE-588)4011146-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd
subject_GND	(DE-588)4011146-5 (DE-588)4031826-6 (DE-588)4130267-9 (DE-588)4134751-1 (DE-588)4001183-5 (DE-588)1071861417
title	Algorithms and computation 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5 - 8, 2011 ; proceedings
title_auth	Algorithms and computation 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5 - 8, 2011 ; proceedings
title_exact_search	Algorithms and computation 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5 - 8, 2011 ; proceedings
title_full	Algorithms and computation 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5 - 8, 2011 ; proceedings Takao Asano ... (eds.)
title_fullStr	Algorithms and computation 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5 - 8, 2011 ; proceedings Takao Asano ... (eds.)
title_full_unstemmed	Algorithms and computation 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5 - 8, 2011 ; proceedings Takao Asano ... (eds.)
title_short	Algorithms and computation
title_sort	algorithms and computation 22nd international symposium isaac 2011 yokohama japan december 5 8 2011 proceedings
title_sub	22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5 - 8, 2011 ; proceedings
topic	Datenstruktur (DE-588)4011146-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd
topic_facet	Datenstruktur Kombinatorische Optimierung Algorithmische Geometrie Berechnungskomplexität Algorithmus Konferenzschrift 2011 Yokohama
url	http://deposit.dnb.de/cgi-bin/dokserv?id=3902795&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=024587477&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV000000607
work_keys_str_mv	AT asanotakao algorithmsandcomputation22ndinternationalsymposiumisaac2011yokohamajapandecember582011proceedings AT isaacyokohama algorithmsandcomputation22ndinternationalsymposiumisaac2011yokohamajapandecember582011proceedings

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Beschreibung

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge