000 | 03770nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-319-41168-2 | ||
003 | DE-He213 | ||
005 | 20200421111158.0 | ||
007 | cr nn 008mamaa | ||
008 | 160704s2016 gw | s |||| 0|eng d | ||
020 |
_a9783319411682 _9978-3-319-41168-2 |
||
024 | 7 |
_a10.1007/978-3-319-41168-2 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
072 | 7 |
_aPBD _2bicssc |
|
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aCOM018000 _2bisacsh |
|
072 | 7 |
_aMAT008000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aAlgorithmic Aspects in Information and Management _h[electronic resource] : _b11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings / _cedited by Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri. |
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2016. |
|
300 |
_aXIV, 223 p. 36 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v9778 |
|
505 | 0 | _aItem Pricing for Combinatorial Public Projects -- Norm-Based Locality Measures of Two-Dimensional Hilbert Curves -- On the Complexity of Clustering with Relaxed Size Constraints -- Superstring Graph: A New Approach for Genome Assembly -- Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees -- A Very Fast String Matching Algorithm Based on Condensed Alphabets -- Minimum-Density Identifying Codes in Square Grids -- Separating Codes and Traffic Monitoring -- Know When to Persist: Deriving Value from a Stream Buffer -- Algorithmic Aspects of Upper Domination: A Parameterised Perspective -- On Network Formation Games with Heterogeneous Players and Basic Network Creation Games -- Parameterized Complexity of Team Formation in Social Networks -- Reconstructing Cactus Graphs from Shortest Path Information -- Near-Optimal Dominating Sets via Random Sampling -- A Multivariate Approach for Checking Resiliency in Access Control -- Efficient Algorithms for the Order Preserving Pattern Matching Problem -- Computing the Line-Constrained k-Center in the Plane for Small k -- Online k-max Search Algorithm with Applications to the Secretary Problem. | |
520 | _aThis volume constitutes the proceedings of the 11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016, held in Bergamo, Italy, in July 2016. The 18 revised full papers presented were carefully reviewed and selected from 41 submissions. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer communication systems. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aPattern recognition. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aData Structures. |
650 | 2 | 4 | _aPattern Recognition. |
650 | 2 | 4 | _aComputer Communication Networks. |
700 | 1 |
_aDondi, Riccardo. _eeditor. |
|
700 | 1 |
_aFertin, Guillaume. _eeditor. |
|
700 | 1 |
_aMauri, Giancarlo. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783319411675 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v9778 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-319-41168-2 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
942 | _cEBK | ||
999 |
_c53683 _d53683 |