UID:
almahu_9947364207202882
Format:
XIV, 680 p.
,
online resource.
ISBN:
9783540697336
Series Statement:
Lecture Notes in Computer Science, 5092
Content:
The refereed proceedings of the 14th Annual International Computing and Combinatorics Conference, COCOON 2008, held in Dalian, China, in June 2008. The 66 revised full papers presented were carefully reviewed and selected from 172 submissions. The papers are organized in topical sections on algorithms and data structures, algorithmic game theory and online algorithms, automata, languages, logic, and computability, combinatorics related to algorithms and complexity, complexity theory, cryptography, reliability and security, and database theory, computational biology and bioinformatics, computational algebra, geometry, and number theory, graph drawing and information visualization, graph theory and algorithms, communication networks, and optimization, wireless network, network optimization, and scheduling problem.
Note:
Algorithms and Data Structures -- Efficient Compression of Web Graphs -- Damaged BZip Files Are Difficult to Repair -- Isoperimetric Problem and Meta-fibonacci Sequences -- Algorithmic Game Theory and Online Algorithms -- On the Complexity of Equilibria Problems in Angel-Daemon Games -- Average-Case Competitive Analyses for One-Way Trading -- On the Monotonicity of Weak Searching -- Automata, Languages, Logic, and Computability -- VC Dimension Bounds for Analytic Algebraic Computations -- Resource Bounded Frequency Computations with Three Errors -- A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model -- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique -- Combinatorics Related to Algorithms and Complexity -- Counting Polycubes without the Dimensionality Curse -- Polychromatic Colorings of n-Dimensional Guillotine-Partitions -- The Computational Complexity of Link Building -- Improved Parameterized Algorithms for Weighted 3-Set Packing -- Structural Identifiability in Low-Rank Matrix Factorization -- Complexity of Counting the Optimal Solutions -- Complexity Theory -- The Orbit Problem Is in the GapL Hierarchy -- Quantum Separation of Local Search and Fixed Point Computation -- Multi-party Quantum Communication Complexity with Routed Messages -- Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments -- Approximating Alternative Solutions -- Dimensions of Points in Self-similar Fractals -- Cryptography, Reliability and Security, and Database Theory -- Visual Cryptography on Graphs -- Algebraic Cryptanalysis of CTRU Cryptosystem -- Computational Biology and Bioinformatics – Model -- Detecting Community Structure by Network Vectorization -- Quasi-bicliques: Complexity and Binding Pairs -- Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis -- Genome Halving under DCJ Revisited -- Haplotype Inferring Via Galled-Tree Networks Is NP-Complete -- Computational Biology and Bioinformatics – Algorithms -- Adjacent Swaps on Strings -- Efficient Algorithms for SNP Haplotype Block Selection Problems -- Sequence Alignment Algorithms for Run-Length-Encoded Strings -- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations -- A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI -- Computational Algebra, Geometry, and Number Theory -- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance -- On Center Regions and Balls Containing Many Points -- On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees -- New Algorithms for Online Rectangle Filling with k-Lookahead -- Geometric Spanner of Objects under L 1 Distance -- Graph Drawing and Information Visualization -- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints -- Graph Theory and Algorithms -- A New Characterization of P 6-Free Graphs -- Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction -- Efficient Algorithms for the k Smallest Cuts Enumeration -- Covering Directed Graphs by In-Trees -- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints -- Probe Ptolemaic Graphs -- Communication Networks and Optimization -- Diagnosability of Two-Matching Composition Networks -- The Iterated Restricted Immediate Snapshot Model -- Finding Frequent Items in a Turnstile Data Stream -- A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints -- Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost -- Wireless Network -- Throughput Maximization with Traffic Profile in Wireless Mesh Network -- Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment -- (6?+??)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs -- Spectrum Bidding in Wireless Networks and Related -- Network Optimization -- (1?+??)-Approximation for Selected-Internal Steiner Minimum Tree -- Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities -- Spreading Messages -- On Some City Guarding Problems -- Optimal Insertion of a Segment Highway in a City Metric -- Approximating the Generalized Capacitated Tree-Routing Problem -- Column Generation Algorithms for the Capacitated m-Ring-Star Problem -- Scheduling Problem -- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine -- A Two-Stage Flexible Flowshop Problem with Deterioration -- A Lower Bound for the On-Line Preemptive Machine Scheduling with ? p Norm -- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries.
In:
Springer eBooks
Additional Edition:
Printed edition: ISBN 9783540697329
Language:
English
DOI:
10.1007/978-3-540-69733-6
URL:
http://dx.doi.org/10.1007/978-3-540-69733-6
Bookmarklink
