Computing and Combinatorics 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings / edited by Joachim Gudmundsson, Julián Mestre, Taso Viglas.

This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012. The 50 revised full papers presented were carefully reviewed and selected from 121 submissions. Topics  covered are algorithms and dat...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Gudmundsson, Joachim (Editor), Mestre, Julián (Editor), Viglas, Taso (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
Edition:1st ed. 2012.
Series:Theoretical Computer Science and General Issues ; 7434
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3328352
003 MWH
005 20191022122236.0
007 cr nn 008mamaa
008 120813s2012 gw | s |||| 0|eng d
020 |a 9783642322419 
024 7 |a 10.1007/978-3-642-32241-9  |2 doi 
035 |a (DE-He213)978-3-642-32241-9 
050 4 |a E-Book 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a UMB  |2 thema 
245 1 0 |a Computing and Combinatorics  |h [electronic resource] :  |b 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings /  |c edited by Joachim Gudmundsson, Julián Mestre, Taso Viglas. 
250 |a 1st ed. 2012. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2012. 
300 |a XIV, 606 p. 116 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues ;  |v 7434 
490 1 |a Springer eBook Collection 
505 0 |a A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree -- A Simple D2-Sampling Based PTAS for k-Means and other Clustering Problems -- Speed Scaling for Maximum Lateness -- Induced Subgraph Isomorphism: Are Some Patterns Substantially -- Easier Than Others -- Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs -- Online Knapsack Problem with Removal Cost -- An Improved Exact Algorithm for TSP in Degree-4 Graphs -- Dynamic Programming for H-minor-free Graphs -- Restricted Max-Min Fair Allocations with Inclusion-Free Intervals -- An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks -- Towards Optimal and Expressive Kernelization for d-Hitting Set.-Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs -- A Local Algorithm for Finding Dense Bipartite-Like Subgraphs -- Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs -- On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property -- Rainbow Colouring of Split and Threshold -- Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Succinct Representations of Binary Trees for Range Minimum Queries. 
520 |a This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012. The 50 revised full papers presented were carefully reviewed and selected from 121 submissions. Topics  covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization. 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Algorithms. 
650 0 |a Computer science—Mathematics. 
650 0 |a Computer communication systems. 
650 0 |a Computers. 
650 0 |a Computer graphics. 
650 0 |a Artificial intelligence. 
690 |a Electronic resources (E-books) 
700 1 |a Gudmundsson, Joachim.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Mestre, Julián.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Viglas, Taso.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Theoretical Computer Science and General Issues ;  |v 7434 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-3-642-32241-9  |3 Click to view e-book  |t 0 
907 |a .b33283527  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g gw   |h 0  |i 1 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i22415142  |z 02-26-20 
999 f f |i fd934571-21e0-562f-ab75-d684379406f1  |s f9c96668-ad93-5ef0-83c6-d62f89c1cd3b  |t 0 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |t 0  |e E-Book  |h Library of Congress classification  |i Elec File