| Description |
1 online resource (xiii, 650 pages) |
| Series |
Lecture notes in computer science, 0302-9743 ; 6842 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 6842. 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Machine generated contents note: Derandomizing HSSW Algorithm for 3-SAT / Masaki Yamamoto -- Dominating Set Counting in Graph Classes / Takeaki Uno -- Density Maximization Problem in Graphs / Dorothea Wagner -- FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time / Sebastian Bocker -- Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems / Pingping Zhang -- Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy / Yong Zhang -- Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum / Francis C.M. Lau -- On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms / Xiao Zhou -- On Parameterized Independent Feedback Vertex Set / Saket Saurabh -- Cograph Editing: Complexity and Parameterized Algorithms / Jianer Chen -- ̂ |
|
Note continued: Unconstrained and Constrained Fault-Tolerant Resource Allocation / Hong Shen -- Finding Paths with Minimum Shared Edges / Hamid Zarrabi-Zadeh -- Combinatorial Group Testing for Corruption Localizing Hashing / Giovanni Di Crescenzo -- Task Ordering and Memory Management Problem for Degree of Parallelism Estimation / Renaud Sirdey -- Computing Majority with Triple Queries / Gabor Wiener -- New Variation of Hat Guessing Games / Huacheng Yu -- Oblivious Transfer and n-Variate Linear Function Evaluation / Liang Feng Zhang -- Optimal Online Algorithms on Two Hierarchical Machines with Resource Augmentation / Jueliang Hu |
| Summary |
This book constitutes the refereed proceedings of the 16th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised full papers presented were carefully reviewed and selected from 136 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; parallel and distributed computing |
| Analysis |
computerwetenschappen |
|
computer sciences |
|
algoritmen |
|
algorithms |
|
computeranalyse |
|
computer analysis |
|
wiskunde |
|
mathematics |
|
computernetwerken |
|
computer networks |
|
computational science |
|
computergrafie |
|
computer graphics |
|
kunstmatige intelligentie |
|
artificial intelligence |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
| Bibliography |
Includes bibliographical references and author index |
| Notes |
Print version record |
| Subject |
Combinatorial analysis -- Data processing -- Congresses
|
|
Computer science -- Congresses
|
|
Informatique.
|
|
Combinatorial analysis -- Data processing
|
|
Computer science
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Fu, Bin (Associate Professor)
|
|
Du, Dingzhu.
|
| ISBN |
9783642226854 |
|
364222685X |
|
9783642226847 |
|
3642226841 |
|
