{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":29,"n_cols":5,"rows_kept":29,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[21,2,21,3],[22,2,22,3],[26,2,26,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466006003316"]
[null,null,"Titolo",null,"Combinatorial Optimization and Applications [[electronic resource] ] : 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II / / edited by Weili Wu, Ovidiu Daescu"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010"]
[null,null,"ISBN",null,"1-280-39058-1"]
[{"$nulls":4},"9786613568502"]
[{"$nulls":4},"3-642-17461-2"]
[null,null,"Edizione",null,"[1st ed. 2010.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XVI, 416 p. 80 illus.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 6509"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Algorithms"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Computer networks"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Bioinformatics"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Computer Communication Networks"]
[{"$nulls":4},"Computer Graphics"]
[{"$nulls":4},"Computational and Systems Biology"]
[{"$nulls":4},"Symbolic and Algebraic Manipulation"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Coverage with k-Transmitters in the Presence of Obstacles -- On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem -- Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations -- Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor Networks -- Time Optimal Algorithms for Black Hole Search in Rings -- Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle -- A Constant-Factor Approximation Algorithm for the Link Building Problem -- XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme -- "]
[{"$nulls":4},"Computational Study for Planar Connected Dominating Set Problem -- Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives -- A Search-Based Approach to the Railway Rolling Stock Allocation Problem -- Approximation Algorithm for the Minimum Directed Tree Cover -- An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs -- A New Result on [k,k?+?1]-Factors Containing Given Hamiltonian Cycles -- Yao Graphs Span Theta Graphs -- A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n 2logn) Expected Time -- New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs -- A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem -- Fast Edge-Searching and Related Problems -- Diameter-Constrained Steiner Tree -- Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks -- A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree -- Constrained Low-Interference Relay Node Deployment for Underwater Acoustic Wireless Sensor Networks -- Structured Overlay Network for File Distribution -- Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations -- The Networked Common Goods Game -- A Novel Branching Strategy for Parameterized Graph Modification Problems -- Listing Triconnected Rooted Plane Graphs -- Bipartite Permutation Graphs Are Reconstructible -- A Transformation from PPTL to S1S -- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs -- Approximate Ellipsoid in the Streaming Model."]
[null,null,null,"Sommario/riassunto","The 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010) took place in Big Island, Hawaii, USA, December 18–20, 2010. Past COCOA conferences were held in Xi’an, China (2007), Newfoundland, Canada (2008)and Huangshan, China (2009). COCOA2010providedaforumforresearchersworkingintheareasofcom- natorial optimization and its applications. In addition to theoretical results, the conference also included recent works on experimental and applied research of general algorithmic interest. The Program Committee received 108 submissions from more than 23 countries and regions, including Australia, Austria, Canada, China, Denmark, France, Germany, Hong Kong, India, Italy, Japan, Korea, Mexico, New Zealand, Poland, Slovak Republic, Spain, Sweden, Switzerland, Taiwan, UK, USA, Vietnam, etc. Among the 108 submissions, 49 regular papers were selected for presentation at the conference and are included in this volume. Some of these papers will be selected for publication in a special issue of the Journal of Combinatorial Optimization, a special issue of Theoretical Computer Science, a special issue of Optimization Letters, and a special issue of Discrete Mathematics, Algorithms and Applications under the standard refereeing procedure."]