skip to content
Computing and combinatorics : 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings Preview this item
ClosePreview this item
Checking...

Computing and combinatorics : 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings

Author: Dingzhu Du; Guochuan Zhang
Publisher: Heidelberg : Springer, [2013]
Series: Lecture notes in computer science, 7936.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Edition/Format:   eBook : Document : Conference publication : EnglishView all editions and formats
Database:WorldCat
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 co-organized workshop on discrete algorithms of which 8 short papers were accepted and a workshop on computational social networks where 12  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Conference proceedings
Congresses
Additional Physical Format: Original print version: COCOON (Conference) (19th : 2013 : Hangzhou, China).
Computing and combinatorics.
Heidelberg : Springer, [2013]
(OCoLC)861311465
Material Type: Conference publication, Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Dingzhu Du; Guochuan Zhang
ISBN: 9783642387685 3642387683
OCLC Number: 845053287
Notes: International conference proceedings.
Includes author index.
Description: 1 online resource (xviii, 861 pages) : illustrations (black and white)
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 ... [et al.] --
Social Exchange Networks with Distant Bargaining / Konstantinos Georgiou ... [et al.] --
The 1/4-Core 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 ... [et al.] --
On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets / Khaled Elbassioni ... [et al.] --
A Fast Algorithm for Data Collection along a Fixed Track / Otfried Cheong, Radwa El Shawi, Joachim Gudmundsson --
Random Methods for Parameterized Problems / Qilong Feng ... [et al.] --
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 Non-preemptive Speed-Scaling Scheduling / Evripidis Bampis ... [et al.] --
Computational Theory. Selection from Read-Only Memory with Limited Workspace / Amr Elmasry ... [et al.] --
Deternimization of Büchi Automata as Partitioned Automata / Cong Tian, Zhenhua Duan, Mengfei Yang --
On Linear-Size 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 ... [et al.] --
Facets for Art Gallery Problems / Sándor P. Fekete ... [et al.] --
Hitting and Piercing Rectangles Induced by a Point Set / Ninad Rajgopal ... [et al.] --
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 Linear-Time Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones Property / Chih-Hsuan Li, Jhih-Hong Ye, Biing-Feng 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 ... [et al.] --
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 k-Separator Problem / Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto --
On the Treewidth of Dynamic Graphs / Bernard Mans, Luke Mathieson --
Square-Orthogonal Drawing with Few Bends per Edge / Yu-An Lin, Sheung-Hung 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 ... [et al.] --
An Efficient Algorithm for One-Sided Block Ordering Problem with Block-Interchange Distance / Kun-Tze Chen ... [et al.] --
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 ... [et al.] --
A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies / Peter Damaschke, Azam Sheikh Muhammad --
A Linear Edge Kernel for Two-Layer Crossing Minimization / Yasuaki Kobayashi ... [et al.] --
A Linear-Time 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 / Hans-Joachim Böckenhauer ... [et al.] --
Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing / Yong Zhang ... [et al.] --
Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints / Hiroshi Fujiwara, Koji Kobayashi --
Parameterized Algorithms. Parameterized Complexity of Flood-Filling 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 ... [et al.] --
An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs / Yunlong Liu ... [et al.] --
Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees / Feng Shi ... [et al.] --
Computational Complexity. Small H-Coloring 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 NP-Hard 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 ... [et al.] --
Algorithms. 2-connecting Outerplanar Graphs without Blowing Up the Pathwidth / Jasine Babu ... [et al.] --
How to Catch L 2-Heavy-Hitters on Sliding Windows / Vladimir Braverman, Ran Gelles, Rafail Ostrovsky --
Time/Memory/Data Tradeoffs for Variants of the RSA Problem / Pierre-Alain Fouque, Damien Vergnaud, Jean-Christophe Zapalowicz --
An Improved Algorithm for Extraction of Exact Boundaries and Boundaries Inclusion Relationship / Tao Hu, Xianyi Ren, Jihong Zhang --
Workshop I. Straight-Line Monotone Grid Drawings of Series-Parallel Graphs / Md. Iqbal Hossain, Md. Saidur Rahman --
Combination of Two-Machine Flow Shop Scheduling and Shortest Path Problems / Kameng Nip, Zhenbo Wang --
The Program Download Problem: Complexity and Algorithms / Chao Peng ... [et al.] --
Finding Theorems in NBG Set Theory by Automated Forward Deduction Based on Strong Relevant Logic / Hongbiao Gao ... [et al.] --
Workshop II. Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank Data / Xingwu Liu, Shang-Hua 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 ... [et al.] --
CSoNet I. A New Model for Product Adoption over Social Networks / Lidan Fan ... [et al.] --
Generating Uncertain Networks Based on Historical Network Snapshots / Meng Han ... [et al.] --
A Short-Term Prediction Model of Topic Popularity on Microblogs / Juanjuan Zhao ... [et al.] --
Social Network Path Analysis Based on HBase / Yan Qiang ... [et al.] --
CSoNet II. Community Expansion Model Based on Charged System Theory / Yuanjun Bi ... [et al.] --
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 ... [et al.] --
Homophilies and Communities Detection among a Subset of Blogfa Persian Weblogs: Computer and Internet Category / Adib Rastegarnia, Meysam Mohajer, Vahid Solouk --
CSoNet III. Neighborhood-Based Dynamic Community Detection with Graph Transform for 0-1 Observed Networks / Li Wang ... [et al.] --
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 ... [et al.] --
Using Network Sciences to Evaluate the Brazilian Airline Network / Douglas Oliveira, Marco Carvalho, Ronaldo Menezes.
Series Title: Lecture notes in computer science, 7936.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Other Titles: COCOON 2013
Responsibility: Ding-Zhu Du, Guochuan Zhang (eds.).
More information:

Abstract:

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 co-organized 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.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/845053287>
library:oclcnum"845053287"
library:placeOfPublication
owl:sameAs<info:oclcnum/845053287>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/868963>
rdf:typeschema:Intangible
schema:name"Combinatorial analysis--Data processing"@en
schema:name"Combinatorial analysis--Data processing."@en
schema:about
schema:about
schema:about
schema:bookFormatschema:EBook
schema:contributor
schema:contributor
schema:creator
schema:datePublished"2013"
schema:description"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 co-organized 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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1370500853>
schema:genre"Electronic books."@en
schema:genre"Conference proceedings."@en
schema:genre"Conference proceedings"@en
schema:inLanguage"en"
schema:name"COCOON 2013"@en
schema:name"Computing and combinatorics : 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings"@en
schema:url
schema:url<http://dx.doi.org/10.1007/978-3-642-38768-5>
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.