Algorithms and computation: 24th international symposium, ISAAC 2013, Hong Kong, China, December 16 - 18, 2013 ; proceedings
Gespeichert in:
| Format: | Elektronisch Tagungsbericht E-Book |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2013
|
| Schriftenreihe: | Lecture notes in computer science
8283 : Advanced research in computing and software science |
| Schlagworte: | |
| Online-Zugang: | DE-634 DE-Aug4 DE-M347 DE-92 DE-859 DE-91 DE-384 DE-473 DE-703 DE-20 DE-706 DE-29 DE-739 Volltext Inhaltsverzeichnis Abstract |
| Beschreibung: | 1 Online-Ressource (XVII, 747 S.) graph. Darst. |
| ISBN: | 9783642450297 9783642450303 |
| DOI: | 10.1007/978-3-642-45030-3 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV041736151 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 140314s2013 xx d||| o|||| 10||| eng d | ||
| 020 | |a 9783642450297 |9 978-3-642-45029-7 | ||
| 020 | |a 9783642450303 |c eISBN |9 978-3-642-45030-3 | ||
| 024 | 7 | |a 10.1007/978-3-642-45030-3 |2 doi | |
| 035 | |a (OCoLC)867052033 | ||
| 035 | |a (DE-599)BVBBV041736151 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-473 |a DE-20 |a DE-91 |a DE-706 |a DE-739 |a DE-384 |a DE-M347 |a DE-703 |a DE-29 |a DE-92 |a DE-Aug4 |a DE-859 |a DE-634 | ||
| 082 | 0 | |a 005.1 | |
| 084 | |a DAT 530f |2 stub | ||
| 245 | 1 | 0 | |a Algorithms and computation |b 24th international symposium, ISAAC 2013, Hong Kong, China, December 16 - 18, 2013 ; proceedings |c Leizhen Cai ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2013 | |
| 300 | |a 1 Online-Ressource (XVII, 747 S.) |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 8283 : Advanced research in computing and software science | |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |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 Netzwerk |0 (DE-588)4171529-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 2013 |z Hongkong |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
| 689 | 4 | |5 DE-604 | |
| 700 | 1 | |a Cai, Leizhen |e Sonstige |0 (DE-588)1046089420 |4 oth | |
| 711 | 2 | |a ISAAC |n 24 |d 2013 |c Hongkong |j Sonstige |0 (DE-588)1045646482 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 8283 : Advanced research in computing and software science |w (DE-604)BV014880109 |9 8283 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-45030-3 |x Verlag |3 Volltext |
| 856 | 4 | 2 | |m Springer Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027182845&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 856 | 4 | 2 | |m Springer Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027182845&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |3 Abstract |
| 912 | |a ZDB-2-LNC | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-027182845 | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-45030-3 |l DE-634 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-45030-3 |l DE-Aug4 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-45030-3 |l DE-M347 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-45030-3 |l DE-92 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-45030-3 |l DE-859 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-45030-3 |l DE-91 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-45030-3 |l DE-384 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-45030-3 |l DE-473 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-45030-3 |l DE-703 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-45030-3 |l DE-20 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-45030-3 |l DE-706 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-45030-3 |l DE-29 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-642-45030-3 |l DE-739 |p ZDB-2-LNC |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1820875565526155264 |
|---|---|
| adam_text |
ALGORITHMS AND COMPUTATION
/
: 2013
TABLE OF CONTENTS / INHALTSVERZEICHNIS
INVITED TALK PAPER
MARKET APPROACH TO SOCIAL ADS: THE MYLIKES EXAMPLE AND RELATED PROBLEMS
SESSION 1A: COMPUTATIONAL GEOMETRY I
GEODESIC-PRESERVING POLYGON SIMPLIFICATION
SPACE-EFFICIENT AND DATA-SENSITIVE POLYGON RECONSTRUCTION ALGORITHMS
FROM VISIBILITY ANGLE INFORMATION
ON THE EDGE CROSSING PROPERTIES OF EUCLIDEAN MINIMUM WEIGHT LAMAN GRAPHS
STRUCTURE AND COMPUTATION OF STRAIGHT SKELETONS IN 3-SPACE
SESSION 1B: PATTERN MATCHING
PATTERN MATCHING WITH NON OVERLAPPING REVERSALS – APPROXIMATION AND
ON-LINE ALGORITHMS
SINGLE AND MULTIPLE CONSECUTIVE PERMUTATION MOTIF SEARCH
BEATING O(NM) IN APPROXIMATE LZW-COMPRESSED PATTERN MATCHING
LESS SPACE: INDEXING FOR QUERIES WITH WILDCARDS
SESSION 2A: COMPUTATIONAL COMPLEXITY I
ON DETERMINING DEEP HOLES OF GENERALIZED REED-SOLOMON CODES
ISOMORPHISM ON SUBGRAPH-CLOSED GRAPH CLASSES: A COMPLEXITY DICHOTOMY AND
INTERMEDIATE GRAPH CLASSES
DETERMINANTAL COMPLEXITIES AND FIELD EXTENSIONS
SESSION 2B: INTERNET AND SOCIAL NETWORK ALGORITHMS I
ALGORITHMS TO MEASURE DIVERSITY AND CLUSTERING IN SOCIAL NETWORKS
THROUGH DOT PRODUCT GRAPHS
SUBLINEAR-TIME ALGORITHMS FOR MONOMER-DIMER SYSTEMS ON BOUNDED DEGREE
GRAPHS
THE COMPLEXITY OF FINDING A LARGE SUBGRAPH UNDER ANONYMITY CONSTRAINTS
SESSION 3A: GRAPH THEORY AND ALGORITHMS I
ON THE NUMBER OF EDGES OF FAN-CROSSING FREE GRAPHS
COPS AND ROBBERS ON INTERSECTION GRAPHS
SEFE WITH NO MAPPING VIA LARGE INDUCED OUTERPLANE GRAPHS IN PLANE GRAPH
HARDNESS AND ALGORITHMS FOR VARIANTS OF LINE GRAPHS OF DIRECTED GRAPHS
SESSION 3B: SCHEDULING ALGORITHMS
PERFORMANCE GUARANTEES FOR SCHEDULING ALGORITHMS UNDER PERTURBED MACHINE
SPEEDS
BETTER BOUNDS FOR ONLINE K-FRAME THROUGHPUT MAXIMIZATION IN NETWORK
SWITCHES
THE SOLVABLE CASES OF A SCHEDULING ALGORITHM
SESSION 4A: COMPUTATIONAL COMPLEXITY II
EXACT SUBLINEAR BINOMIAL SAMPLING
TRIVIAL, TRACTABLE, HARD. A NOT SO SUDDEN COMPLEXITY JUMP IN
NEIGHBORHOOD RESTRICTED CNF FORMULAS
DYNAMIC POINT LABELING IS STRONGLY PSPACE-COMPLETE
UNSATISFIABLE CNF FORMULAS CONTAIN MANY CONFLICTS
SESSION 4B: COMPUTATIONAL GEOMETRY II
PURSUIT EVASION ON POLYHEDRAL SURFACES
ALGORITHMS FOR TOLERATED TVERBERG PARTITIONS
ABSTRACT VORONOI DIAGRAMS WITH DISCONNECTED REGIONS
TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS
SESSION 5A: GRAPH THEORY AND ALGORITHMS II
EXACT ALGORITHMS FOR MAXIMUM INDEPENDENT SET
ON THE ENUMERATION AND COUNTING OF MINIMAL DOMINATING SETS IN INTERVAL
AND PERMUTATION GRAPHS
TESTING MUTUAL DUALITY OF PLANAR GRAPH
SESSION 5B: FIXED-PARAMETER TRACTABLE ALGORITHMS
EFFECTIVE AND EFFICIENT DATA REDUCTION FOR THE SUBSET INTERCONNECTION
DESIGN PROBLEM
MYHILL-NERODE METHODS FOR HYPERGRAPHS
AUGMENTING GRAPHS TO MINIMIZE THE DIAMETER
SESSION 6A: ALGORITHMS AND DATA STRUCTURES I
TOP-K DOCUMENT RETRIEVAL IN COMPACT SPACE AND NEAR-OPTIMAL TIME
FASTER, SPACE-EFFICIENT SELECTION ALGORITHMS IN READ-ONLY MEMORY FOR
INTEGERS
TRAJECTORY-BASED DYNAMIC MAP LABELING
SESSION 6B: INTERNET AND SOCIAL NETWORK
ALGORITHMS II
ASYNCHRONOUS RUMOR SPREADING ON RANDOM GRAPHS
UNIT COST BUYBACK PROBLEM
FASTER RUMOR SPREADING WITH MULTIPLE CALLS
SESSION 7A: ALGORITHMIC GAME THEORY
APPROXIMATING THE VALUE OF A CONCURRENT REACHABILITY GAME IN THE
POLYNOMIAL TIME HIERARCHY
COMPUTING A WALRASIAN EQUILIBRIUM IN ITERATIVE AUCTIONS WITH MULTIPLE
DIFFERENTIATED ITEMS
NEW RESULTS ON THE ONLINE PRICING PROBLEM
SESSION 7B: ALGORITHMS AND DATA STRUCTURES II
RAM-EFFICIENT EXTERNAL MEMORY SORTING
SUCCINCT DATA STRUCTURES FOR REPRESENTING EQUIVALENCE CLASSES
SLIDING BLOOM FILTERS
SESSION 8A: GRAPH THEORY AND ALGORITHMS III
VERTEX-WEIGHTED MATCHING IN TWO-DIRECTIONAL ORTHOGONAL RAY GRAPHS
BOUNDED REPRESENTATIONS OF INTERVAL AND PROPER INTERVAL GRAPHS
DETECTING AND COUNTING SMALL PATTERN GRAPHS
AN O∗(1.1939N) TIME ALGORITHM FOR MINIMUM WEIGHTED DOMINATING INDUCED
MATCHING
SESSION 8B: APPROXIMATION ALGORITHMS I
NEW INAPPROXIMABILITY BOUNDS FOR TSP
SMOOTHED ANALYSIS OF THE 2-OPT HEURISTIC FOR THE TSP: POLYNOMIAL BOUNDS
FOR GAUSSIAN NOISE
TIGHT APPROXIMATION BOUNDS FOR CONNECTIVITY WITH A COLOR-SPANNING SET
THE TRAIN DELIVERY PROBLEM REVISITED
SESSION 9A: COMPUTATIONAL GEOMETRY III
THE DISTANCE 4-SECTOR OF TWO POINTS IS UNIQUE
THE NUMBER OF DIFFERENT UNFOLDINGS OF POLYHEDRA
COMPUTING THE SMALLEST COLOR-SPANNING AXIS-PARALLEL SQUARE
SESSION 9B: APPROXIMATION ALGORITHMS II
EUCLIDEAN TRAVELING SALESMAN TOURS THROUGH STOCHASTIC NEIGHBORHOODS
DETECTING AND CHARACTERIZING SMALL DENSE BIPARTITE-LIKE SUBGRAPHS BY THE
BIPARTITENESS RATIO MEASURE
APPROXIMATE ˇCECH COMPLEX IN LOW AND HIGH DIMENSIONS
SESSION 10A: COMPUTATIONAL COMPLEXITY III
MODEL COUNTING FOR FORMULAS OF BOUNDED CLIQUE- WIDTH
COMPUTING PLURALITY POINTS AND CONDORCET POINTS IN EUCLIDEAN SPACE
COMPUTING MINIMUM TILE SETS TO SELF-ASSEMBLE COLOR PATTERNS
SESSION 10B: NETWORK ALGORITHMS
A PROBABILISTIC ANALYSIS OF KADEMLIA NETWORKS
APPROXIMATING THE GENERALIZED MINIMUM MANHATTAN NETWORK PROBLEM
MINMAX REGRET 1-FACILITY LOCATION ON UNCERTAIN PATH NETWORKS
DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
ALGORITHMS AND COMPUTATION
/
: 2013
ABSTRACT / INHALTSTEXT
THIS BOOK CONSTITUTES THE REFEREED PROCEEDINGS OF THE 24TH INTERNATIONAL
SYMPOSIUM ON ALGORITHMS AND COMPUTATION, ISAAC 2013, HELD IN HONG KONG,
CHINA IN DECEMBER 2013. THE 67 REVISED FULL PAPERS PRESENTED TOGETHER
WITH 2 INVITED TALKS WERE CAREFULLY REVIEWED AND SELECTED FROM 177
SUBMISSIONS FOR INCLUSION IN THE BOOK. THE FOCUS OF THE VOLUME IN ON THE
FOLLOWING TOPICS: COMPUTATION GEOMETRY, PATTERN MATCHING, COMPUTATIONAL
COMPLEXITY, INTERNET AND SOCIAL NETWORK ALGORITHMS, GRAPH THEORY AND
ALGORITHMS, SCHEDULING ALGORITHMS, FIXED-PARAMETER TRACTABLE ALGORITHMS,
ALGORITHMS AND DATA STRUCTURES, ALGORITHMIC GAME THEORY, APPROXIMATION
ALGORITHMS AND NETWORK ALGORITHMS
DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT. |
| any_adam_object | 1 |
| author_GND | (DE-588)1046089420 |
| building | Verbundindex |
| bvnumber | BV041736151 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 530f |
| collection | ZDB-2-LNC |
| ctrlnum | (OCoLC)867052033 (DE-599)BVBBV041736151 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1007/978-3-642-45030-3 |
| format | Electronic Conference Proceeding eBook |
| 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">BV041736151</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">140314s2013 xx d||| o|||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642450297</subfield><subfield code="9">978-3-642-45029-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642450303</subfield><subfield code="c">eISBN</subfield><subfield code="9">978-3-642-45030-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-45030-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)867052033</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV041736151</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-473</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</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">24th international symposium, ISAAC 2013, Hong Kong, China, December 16 - 18, 2013 ; proceedings</subfield><subfield code="c">Leizhen Cai ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVII, 747 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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</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">8283 : Advanced research in computing and software science</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</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">Netzwerk</subfield><subfield code="0">(DE-588)4171529-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">2013</subfield><subfield code="z">Hongkong</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">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</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">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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">Graph</subfield><subfield code="0">(DE-588)4021842-9</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">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</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">Cai, Leizhen</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1046089420</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">ISAAC</subfield><subfield code="n">24</subfield><subfield code="d">2013</subfield><subfield code="c">Hongkong</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)1045646482</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">8283 : Advanced research in computing and software science</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">8283</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-45030-3</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</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=027182845&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</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=027182845&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Abstract</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027182845</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-45030-3</subfield><subfield code="l">DE-634</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-45030-3</subfield><subfield code="l">DE-Aug4</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-45030-3</subfield><subfield code="l">DE-M347</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-45030-3</subfield><subfield code="l">DE-92</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-45030-3</subfield><subfield code="l">DE-859</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-45030-3</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-45030-3</subfield><subfield code="l">DE-384</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-45030-3</subfield><subfield code="l">DE-473</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-45030-3</subfield><subfield code="l">DE-703</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-45030-3</subfield><subfield code="l">DE-20</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-45030-3</subfield><subfield code="l">DE-706</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-45030-3</subfield><subfield code="l">DE-29</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-45030-3</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2013 Hongkong gnd-content |
| genre_facet | Konferenzschrift 2013 Hongkong |
| id | DE-604.BV041736151 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:17:39Z |
| institution | BVB |
| institution_GND | (DE-588)1045646482 |
| isbn | 9783642450297 9783642450303 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027182845 |
| oclc_num | 867052033 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-20 DE-91 DE-BY-TUM DE-706 DE-739 DE-384 DE-M347 DE-703 DE-29 DE-92 DE-Aug4 DE-859 DE-634 |
| owner_facet | DE-473 DE-BY-UBG DE-20 DE-91 DE-BY-TUM DE-706 DE-739 DE-384 DE-M347 DE-703 DE-29 DE-92 DE-Aug4 DE-859 DE-634 |
| physical | 1 Online-Ressource (XVII, 747 S.) graph. Darst. |
| psigel | ZDB-2-LNC |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Algorithms and computation 24th international symposium, ISAAC 2013, Hong Kong, China, December 16 - 18, 2013 ; proceedings Leizhen Cai ... (eds.) Berlin [u.a.] Springer 2013 1 Online-Ressource (XVII, 747 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 8283 : Advanced research in computing and software science Graph (DE-588)4021842-9 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Netzwerk (DE-588)4171529-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 2013 Hongkong gnd-content Algorithmus (DE-588)4001183-5 s DE-604 Berechnungskomplexität (DE-588)4134751-1 s Algorithmische Geometrie (DE-588)4130267-9 s Graph (DE-588)4021842-9 s Netzwerk (DE-588)4171529-9 s Cai, Leizhen Sonstige (DE-588)1046089420 oth ISAAC 24 2013 Hongkong Sonstige (DE-588)1045646482 oth Lecture notes in computer science 8283 : Advanced research in computing and software science (DE-604)BV014880109 8283 https://doi.org/10.1007/978-3-642-45030-3 Verlag Volltext Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027182845&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027182845&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA Abstract |
| spellingShingle | Algorithms and computation 24th international symposium, ISAAC 2013, Hong Kong, China, December 16 - 18, 2013 ; proceedings Lecture notes in computer science Graph (DE-588)4021842-9 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Netzwerk (DE-588)4171529-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4021842-9 (DE-588)4130267-9 (DE-588)4171529-9 (DE-588)4134751-1 (DE-588)4001183-5 (DE-588)1071861417 |
| title | Algorithms and computation 24th international symposium, ISAAC 2013, Hong Kong, China, December 16 - 18, 2013 ; proceedings |
| title_auth | Algorithms and computation 24th international symposium, ISAAC 2013, Hong Kong, China, December 16 - 18, 2013 ; proceedings |
| title_exact_search | Algorithms and computation 24th international symposium, ISAAC 2013, Hong Kong, China, December 16 - 18, 2013 ; proceedings |
| title_full | Algorithms and computation 24th international symposium, ISAAC 2013, Hong Kong, China, December 16 - 18, 2013 ; proceedings Leizhen Cai ... (eds.) |
| title_fullStr | Algorithms and computation 24th international symposium, ISAAC 2013, Hong Kong, China, December 16 - 18, 2013 ; proceedings Leizhen Cai ... (eds.) |
| title_full_unstemmed | Algorithms and computation 24th international symposium, ISAAC 2013, Hong Kong, China, December 16 - 18, 2013 ; proceedings Leizhen Cai ... (eds.) |
| title_short | Algorithms and computation |
| title_sort | algorithms and computation 24th international symposium isaac 2013 hong kong china december 16 18 2013 proceedings |
| title_sub | 24th international symposium, ISAAC 2013, Hong Kong, China, December 16 - 18, 2013 ; proceedings |
| topic | Graph (DE-588)4021842-9 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Netzwerk (DE-588)4171529-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Graph Algorithmische Geometrie Netzwerk Berechnungskomplexität Algorithmus Konferenzschrift 2013 Hongkong |
| url | https://doi.org/10.1007/978-3-642-45030-3 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027182845&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027182845&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT caileizhen algorithmsandcomputation24thinternationalsymposiumisaac2013hongkongchinadecember16182013proceedings AT isaachongkong algorithmsandcomputation24thinternationalsymposiumisaac2013hongkongchinadecember16182013proceedings |