Physical description 
1 online resource (xviii, 861 pages) : illustrations (black and white). 
Series 
Lecture notes in computer science, 03029743 ; 7936


LNCS sublibrary. SL 1, Theoretical computer science and general issues 

Lecture notes in computer science ; 7936.


LNCS sublibrary. SL 1, Theoretical computer science and general issues.


Springer Lecture Notes in Computer Science

Contents 
Keynote. Recent Results for Online Makespan Minimization / Susanne Albers  Optimal Stopping Meets Combinatorial Optimization / Robert Kleinberg  Game Theory. New Bounds for the Balloon Popping Problem / Davide Bilò, Vittorio Bilò  On the Sequential Price of Anarchy of Isolation Games / Anna Angelucci [and others]  Social Exchange Networks with Distant Bargaining / Konstantinos Georgiou [and others]  The 1/4Core of the Uniform Bin Packing Game Is Nonempty / Walter Kern, Xian Qiu  Randomized Algorithms. On the Advice Complexity of the Online L(2,1)Coloring Problem on Paths and Cycles / Maria Paola Bianchi [and others]  On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets / Khaled Elbassioni [and others]  A Fast Algorithm for Data Collection along a Fixed Track / Otfried Cheong, Radwa El Shawi, Joachim Gudmundsson  Random Methods for Parameterized Problems / Qilong Feng [and others]. 

Scheduling Algorithms. DVS Scheduling in a Line or a Star Network of Processors / Zongxu Mu, Minming Li  Online Algorithms for Batch Machines Scheduling with Delivery Times / Peihai Liu, Xiwen Lu  How to Schedule the Marketing of Products with Negative Externalities / Zhigang Cao, Xujin Chen, Changjun Wang  From Preemptive to Nonpreemptive SpeedScaling Scheduling / Evripidis Bampis [and others]  Computational Theory. Selection from ReadOnly Memory with Limited Workspace / Amr Elmasry [and others]  Deternimization of Büchi Automata as Partitioned Automata / Cong Tian, Zhenhua Duan, Mengfei Yang  On LinearSize Pseudorandom Generators and Hardcore Functions / Joshua Baron, Yuval Ishai, Rafail Ostrovsky  A Fast Algorithm Finding the Shortest Reset Words / Andrzej Kisielewicz, Jakub Kowalski, Marek Szykuła. 

Computational Geometry. The Discrete Voronoi Game in a Simple Polygon / Aritra Banik [and others]  Facets for Art Gallery Problems / Sándor P. Fekete [and others]  Hitting and Piercing Rectangles Induced by a Point Set / Ninad Rajgopal [and others]  Realistic Roofs over a Rectilinear Polygon Revisited / Jessica Sherette, Sang Duk Yoon  Graph Algorithms I. Parametric Power Supply Networks / Shiho Morishita, Takao Nishizeki  Approximating the Minimum Independent Dominating Set in Perturbed Graphs / Weitian Tong, Randy Goebel, Guohui Lin  A LinearTime Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones Property / ChihHsuan Li, JhihHong Ye, BiingFeng Wang  On the Conjunctive Capacity of Graphs / Miroslav Chlebík, Janka Chlebíková 

Approximation Algorithms. Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty / Yu Li [and others]  An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems / Chenchen Wu, Donglei Du, Dachuan Xu  Improved Local Search for Universal Facility Location / Eric Angel, Nguyen Kim Thang, Damien Regnault  Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints / Longkun Guo, Hong Shen, Kewen Liao  Graph Algorithms II. The kSeparator Problem / Walid BenAmeur, MohamedAhmed MohamedSidi, José Neto  On the Treewidth of Dynamic Graphs / Bernard Mans, Luke Mathieson  SquareOrthogonal Drawing with Few Bends per Edge / YuAn Lin, SheungHung Poon  Covering Tree with Stars / Jan Baumbach, Jiong Guo, Rashid Ibragimov. 

Computational Biology. A Polynomial Time Approximation Scheme for the Closest Shared Center Problem / Weidong Li, Lusheng Wang, Wenjuan Cui  An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies / Nan Liu [and others]  An Efficient Algorithm for OneSided Block Ordering Problem with BlockInterchange Distance / KunTze Chen [and others]  A Combinatorial Approach for Multiple RNA Interaction: Formulations, Approximations, and Heuristics / Syed Ali Ahmed, Saad Mneimneh, Nancy L. Greenbaum  Graph Algorithms III. Maximum Balanced Subgraph Problem Parameterized above Lower Bound / Robert Crowston [and others]  A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies / Peter Damaschke, Azam Sheikh Muhammad  A Linear Edge Kernel for TwoLayer Crossing Minimization / Yasuaki Kobayashi [and others]  A LinearTime Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product / Christophe Crespelle, Eric Thierry, Thomas Lambert. 

Online Algorithms. Metrical Service Systems with Multiple Servers / Ashish Chiplunkar, Sundar Vishwanathan  The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity / HansJoachim Böckenhauer [and others]  Online Algorithms for 1Space Bounded 2Dimensional Bin Packing and Square Packing / Yong Zhang [and others]  Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints / Hiroshi Fujiwara, Koji Kobayashi  Parameterized Algorithms. Parameterized Complexity of FloodFilling Games on Trees / Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva  Parameterized Approximability of Maximizing the Spread of Influence in Networks / Cristina Bazgan [and others]  An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs / Yunlong Liu [and others]  Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees / Feng Shi [and others]. 

Computational Complexity. Small HColoring Problems for Bounded Degree Digraphs / Pavol Hell, Aurosish Mishra  Bounded Model Checking for Propositional Projection Temporal Logic / Zhenhua Duan, Cong Tian, Mengfei Yang, Jia He  Packing Cubes into a Cube Is NPHard in the Strong Sense / Yiping Lu, Danny Z. Chen, Jianzhong Cha  On the Complexity of Solving or Approximating Convex Recoloring Problems / Manoel B. Campêlo [and others]  Algorithms. 2connecting Outerplanar Graphs without Blowing Up the Pathwidth / Jasine Babu [and others]  How to Catch L 2HeavyHitters on Sliding Windows / Vladimir Braverman, Ran Gelles, Rafail Ostrovsky  Time/Memory/Data Tradeoffs for Variants of the RSA Problem / PierreAlain Fouque, Damien Vergnaud, JeanChristophe Zapalowicz  An Improved Algorithm for Extraction of Exact Boundaries and Boundaries Inclusion Relationship / Tao Hu, Xianyi Ren, Jihong Zhang. 

Workshop I. StraightLine Monotone Grid Drawings of SeriesParallel Graphs / Md. Iqbal Hossain, Md. Saidur Rahman  Combination of TwoMachine Flow Shop Scheduling and Shortest Path Problems / Kameng Nip, Zhenbo Wang  The Program Download Problem: Complexity and Algorithms / Chao Peng [and others]  Finding Theorems in NBG Set Theory by Automated Forward Deduction Based on Strong Relevant Logic / Hongbiao Gao [and others]  Workshop II. Perturbation Analysis of MaximumWeighted Bipartite Matchings with Low Rank Data / Xingwu Liu, ShangHua Teng  Sublinear Time Approximate Sum via Uniform Random Sampling / Bin Fu, Wenfeng Li, Zhiyong Peng  Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract) / Zhao Lu, Tian Liu, Ke Xu  On the Minimum Caterpillar Problem in Digraphs / Taku Okada [and others]. 

CSoNet I. A New Model for Product Adoption over Social Networks / Lidan Fan [and others]  Generating Uncertain Networks Based on Historical Network Snapshots / Meng Han [and others]  A ShortTerm Prediction Model of Topic Popularity on Microblogs / Juanjuan Zhao [and others]  Social Network Path Analysis Based on HBase / Yan Qiang [and others]  CSoNet II. Community Expansion Model Based on Charged System Theory / Yuanjun Bi [and others]  Centrality and Spectral Radius in Dynamic Communication Networks / Danica Vukadinović Greetham, Zhivko Stoyanov, Peter Grindrod  Finding Network Communities Using Random Walkers with Improved Accuracy / You Li [and others]  Homophilies and Communities Detection among a Subset of Blogfa Persian Weblogs: Computer and Internet Category / Adib Rastegarnia, Meysam Mohajer, Vahid Solouk. 

CSoNet III. NeighborhoodBased Dynamic Community Detection with Graph Transform for 01 Observed Networks / Li Wang [and others]  Effects of Inoculation Based on Structural Centrality on Rumor Dynamics in Social Networks / Anurag Singh, Rahul Kumar, Yatindra Nath Singh  A Dominating Set Based Approach to Identify Effective Leader Group of Social Network / Donghyun Kim [and others]  Using Network Sciences to Evaluate the Brazilian Airline Network / Douglas Oliveira, Marco Carvalho, Ronaldo Menezes. 
Notes 
International conference proceedings. 

Includes author index. 
Summary 
This book constitutes the refereed proceedings of the 19th International Conference on Computing and Combinatorics, COCOON 2013, held in Hangzhou, China, in June 2013. The 56 revised full papers presented were carefully reviewed and selected from 120 submissions. There was a coorganized workshop on discrete algorithms of which 8 short papers were accepted and a workshop on computational social networks where 12 papers out of 25 submissions were accepted. 
Other author 
Du, Dingzhu, editor.


Zhang, Guochuan, editor.


SpringerLink issuing body.

Subject 
Combinatorial analysis  Data processing  Congresses.


Computer science  Congresses.


Computer science. 

Computer Communication Networks. 

Computer software. 

Logic design. 

Computational complexity. 

Artificial intelligence. 

Algorithm Analysis and Problem Complexity. 

Discrete Mathematics in Computer Science. 

Computation by Abstract Devices. 

Congresses. 

Electronic books. 

Conference papers and proceedings. 
Variant Title 
COCOON 2013 
ISBN 
9783642387685 

3642387683 

9783642387678 
