Algorithms and Complexity 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings /

Corporate Author: SpringerLink (Online service)
Other Authors: Calamoneri, Tiziana., Diaz, Josep.
Format: Electronic
Language: English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Series: Lecture Notes in Computer Science, 6078
Subjects:
Online Access: http://dx.doi.org/10.1007/978-3-642-13073-1
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 04271nam a22005655i 4500
001 978-3-642-13073-1
003 DE-He213
005 20170324004131.0
007 cr nn 008mamaa
008 100510s2010 gw | s |||| 0|eng d
020 |a 9783642130731  |9 978-3-642-13073-1 
024 7 |a 10.1007/978-3-642-13073-1  |2 doi 
050 4 |a QA76.6-76.66 
072 7 |a UM  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
082 0 4 |a 005.11  |2 23 
245 1 0 |a Algorithms and Complexity  |h [electronic resource] :  |b 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings /  |c edited by Tiziana Calamoneri, Josep Diaz. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 |a XI, 384 p.  |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 Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6078 
505 0 |a Invited Talks -- Towards a Distributed Search Engine -- Mechanisms for the Marriage and the Assignment Game -- Resilient Algorithms and Data Structures -- Session 1. Graph Algorithms I -- An Exact Algorithm for Connected Red-Blue Dominating Set -- Maximizing PageRank with New Backlinks -- Enumerating Rooted Graphs with Reflectional Block Structures -- Improved Approximations for TSP with Simple Precedence Constraints -- Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number -- Session 2. Computational Complexity -- Parameterized Complexity of Even/Odd Subgraph Problems -- Popular Matchings in the Marriage and Roommates Problems -- Bounding the Number of Tolerable Faults in Majority-Based Systems -- A Parameterized Algorithm for Chordal Sandwich -- Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown -- Session 3. Graph Coloring -- Graph Unique-Maximum and Conflict-Free Colorings -- Strategic Coloring of a Graph -- Session 4. Tree Algorithms and Tree Decompositions -- Multicut Algorithms via Tree Decompositions -- The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality -- Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights -- A Planar Linear Arboricity Conjecture -- Session 5. Computational Geometry -- On the Number of Higher Order Delaunay Triangulations -- How Simple Robots Benefit from Looking Back -- Session 6. Game Theory -- On Strategy Improvement Algorithms for Simple Stochastic Games -- Online Cooperative Cost Sharing -- Session 7. Graph Algorithms II -- On the Power of Nodes of Degree Four in the Local Max-Cut Problem -- Packing Bipartite Graphs with Covers of Complete Bipartite Graphs -- Irredundant Set Faster Than O(2 n ) -- The Complexity of Computing Minimal Unidirectional Covering Sets -- A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance -- Session 8. String Algorithms -- Finding the Maximum Suffix with Fewer Comparisons -- An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences -- Session 9. Network Algorithms -- Capacitated Confluent Flows: Complexity and Algorithms -- Preprocessing Speed-Up Techniques Is Hard -- Communication Requirements for Stable Marriages. 
650 0 |a Computer science. 
650 0 |a Computer communication systems. 
650 0 |a Computer programming. 
650 0 |a Data structures (Computer science). 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 1 4 |a Computer Science. 
650 2 4 |a Programming Techniques. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Data Structures. 
700 1 |a Calamoneri, Tiziana.  |e editor. 
700 1 |a Diaz, Josep.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642130724 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6078 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-13073-1 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645) 
999 |c 45325  |d 45325