| 000 | 07557nam a22005415i 4500 | ||
|---|---|---|---|
| 001 | u374653 | ||
| 003 | SIRSI | ||
| 005 | 20160812084245.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100628s2010 gw | s |||| 0|eng d | ||
| 020 |
_a9783642140310 _9978-3-642-14031-0 |
||
| 040 | _cMX-MeUAM | ||
| 050 | 4 | _aQA76.9.A43 | |
| 082 | 0 | 4 |
_a005.1 _223 |
| 100 | 1 |
_aThai, My T. _eeditor. |
|
| 245 | 1 | 0 |
_aComputing and Combinatorics _h[recurso electrónico] : _b16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings / _cedited by My T. Thai, Sartaj Sahni. |
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010. |
|
| 300 |
_a553p. 103 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 ; _v6196 |
|
| 505 | 0 | _aInvited Talks -- Understanding and Inductive Inference -- Computing with Cells: Membrane Systems -- Complexity and Inapproximability -- Boxicity and Poset Dimension -- On the Hardness against Constant-Depth Linear-Size Circuits -- A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model -- The Curse of Connectivity: t-Total Vertex (Edge) Cover -- Counting Paths in VPA Is Complete for #NC 1 -- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas -- Approximation Algorithms -- Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing -- Clustering with or without the Approximation -- A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks -- Approximate Weighted Farthest Neighbors and Minimum Dilation Stars -- Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs -- Graph Theory and Algorithms -- Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph -- Triangle-Free 2-Matchings Revisited -- The Cover Time of Deterministic Random Walks -- Finding Maximum Edge Bicliques in Convex Bipartite Graphs -- A Note on Vertex Cover in Graphs with Maximum Degree 3 -- Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming -- Factorization of Cartesian Products of Hypergraphs -- Graph Drawing and Coloring -- Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs -- On Three Parameters of Invisibility Graphs -- Imbalance Is Fixed Parameter Tractable -- The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs -- Computational Geometry -- Optimal Binary Space Partitions in the Plane -- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems -- Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux -- Detecting Areas Visited Regularly -- Tile-Packing Tomography Is -hard -- The Rectilinear k-Bends TSP -- Tracking a Generator by Persistence -- Auspicious Tatami Mat Arrangements -- Automata, Logic, Algebra and Number Theory -- Faster Generation of Shorthand Universal Cycles for Permutations -- The Complexity of Word Circuits -- On the Density of Regular and Context-Free Languages -- Extensions of the Minimum Cost Homomorphism Problem -- The Longest Almost-Increasing Subsequence -- Universal Test Sets for Reversible Circuits -- Approximate Counting with a Floating-Point Counter -- Network Optimization and Scheduling Algorithm -- Broadcasting in Heterogeneous Tree Networks -- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks -- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties -- Computational Biology and Bioinformatics -- Discovering Pairwise Compatibility Graphs -- Near Optimal Solutions for Maximum Quasi-bicliques -- Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial -- Constant Time Approximation Scheme for Largest Well Predicted Subset -- On Sorting Permutations by Double-Cut-and-Joins -- A Three-String Approach to the Closest String Problem -- A 2k Kernel for the Cluster Editing Problem -- Data Structure and Sampling Theory -- On the Computation of 3D Visibility Skeletons -- The Violation Heap: A Relaxed Fibonacci-Like Heap -- Threshold Rules for Online Sample Selection -- Heterogeneous Subset Sampling -- Cryptography, Security, Coding and Game Theory -- Identity-Based Authenticated Asymmetric Group Key Agreement Protocol -- Zero-Knowledge Argument for Simultaneous Discrete Logarithms -- Directed Figure Codes: Decidability Frontier. | |
| 520 | _aThe papers in this volume were selected for presentation at the 16th Annual InternationalComputing and CombinatoricsConference (COCOON 2010), held duringJuly19–21,2010inNhaTrang,Vietnam.Previousmeetingsofthisconf- encewereheldinSingapore(2002),BigSky(2003),JejuIsland(2004),Kunming (2005), Taipei (2006), Alberta (2007), Dalian (2008) and New York (2009). COCOON 2010 provided a forum for researchers working in the areas of - gorithms, theory of computation, computational complexity, and combinatorics related to computing. In all, 133 papers were submitted from 40 countries and regions, of which 54 were accepted. Authors of the submitted papers were from Australia (10), Bangladesh (11), Belgium (1), Canada (23), Chile (1), China (20), Colombia (1), Czech Republic (6), Denmark (1), France (25), France(1), Germany (13), Greece (2), Hong Kong (7), Hungary (2), India (18), Indonesia (8),IslamicRepublicofIran(2),Ireland(1),Israel(6),Italy(6),Japan(31),- publicofKorea(4),Malaysia(1),TheNetherlands(2),NewZealand(2),Norway (3), Pakistan (1), Poland (1), Portugal (1), Russian Federation (3), Singapore (6), Slovakia (1), Spain (7), Sweden (2), Taiwan (19), Thailand (2), UK (2), USA (44), and Vietnam (15). The submitted papers wereevaluated by an internationalTechnical Program Committee (TPC). Each paper was evaluated by at least three TPC members, with possible assistance of the external referees, as indicated by the referee list found in the proceedings. Some of these 54 accepted papers will be selected for publication in a special issue of Algorithmica, Journal of Combinatorial - timization,and Discrete Mathematics, Algorithms, and Application under the standard refereeing procedure. In addition to the selected papers, the conf- ence also included two invited presentations by Manuel Blum (Carnegie Mellon University) and Oscar H. Ibarra (University of California Santa Barbara). | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aComputer Communication Networks. | |
| 650 | 0 | _aComputer software. | |
| 650 | 0 | _aComputational complexity. | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 0 | _aComputer graphics. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 650 | 2 | 4 | _aComputer Communication Networks. |
| 650 | 2 | 4 | _aComputation by Abstract Devices. |
| 650 | 2 | 4 | _aComputer Graphics. |
| 650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
| 700 | 1 |
_aSahni, Sartaj. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642140303 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6196 |
|
| 856 | 4 | 0 |
_zLibro electrónico _uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-14031-0 |
| 596 | _a19 | ||
| 942 | _cLIBRO_ELEC | ||
| 999 |
_c202533 _d202533 |
||