Reset Filters
CLC: O - 数理科学和化学

Cover is for reference only

Algorithms and complexity 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings /

This book constitutes the refereed conference proceedings of the 8th International Conference on Algorithms and Complexity, CIAC 2013, held in Barcelona, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present c...

Full description

Saved in:
Bibliographic Details
Corporate Authors: International Conference on Algorithms and Complexity Barcelona, Spain); SpringerLink (Online service)
Group Author: Spirakis, P. G. (Paul G.), 1955-; Serna, Maria, 1959-
Published:
Literature type: Electronic eBook
Language: English
Series: Lecture notes in computer science, 7878
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Subjects:
Algorithms > Congresses.
Computer algorithms > Congresses.
Computational complexity > Congresses.
Computational complexity.
Computer algorithms.
Computer science.
Computer Communication Networks.
Data structures (Computer science)
Computer software.
Electronic data processing.
Computer graphics.
Discrete Mathematics in Computer Science.
Numeric Computing.
Electronic books.
Conference proceedings.
Online Access: http://dx.doi.org/10.1007/978-3-642-38233-8
Summary: This book constitutes the refereed conference proceedings of the 8th International Conference on Algorithms and Complexity, CIAC 2013, held in Barcelona, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.
Item Description: International conference proceedings.
Carrier Form: 1 online resource (381 p.) : ill.
Bibliography: Includes bibliographical references and index.
ISBN: 9783642382338 (electronic bk.)
3642382339 (electronic bk.)
Index Number: QA76
CLC: TP301-532
Contents: Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost /
Parameterized Complexity and Kernel Bounds for Hard Planning Problems /
Selfish Resource Allocation in Optical Networks /
Average Optimal String Matching in Packed Strings /
Parameterized Complexity of DAG Partitioning /
Four Measures of Nonlinearity /
On the Characterization of Plane Bus Graphs /
Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items /
A Greedy Approximation Algorithm for Minimum-Gap Scheduling /
Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas /
Linear Time Distributed Swap Edge Algorithms /
Decentralized Throughput Scheduling /
New Results on Stabbing Segments with a Polygon /
Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games /
Complexity of Barrier Coverage with Relocatable Sensors in the Plane /
Succinct Permanent Is NEXP-Hard with Many Hard Instances /
Money-Based Coordination of Network Packets /
Truthful Many-to-Many Assignment with Private Weights /
Competitive Online Clique Clustering /
Optimal Network Decontamination with Threshold Immunity /
Finding All Convex Cuts of a Plane Graph in Cubic Time /
Shortest Paths with Bundles and Non-additive Weights Is Hard /
Cliques and Clubs /
List Coloring in the Absence of Two Subgraphs /
Query Complexity of Matroids /
A New Dynamic Graph Structure for Large-Scale Transportation Networks /
Capacitated Rank-Maximal Matchings /
A Faster CREW PRAM Algorithm for Computing Cartesian Trees /
Advice Complexity of the Online Coloring Problem /
Sparse Linear Complementarity Problems /
LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem /

Related Book Recommendations