{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"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":43,"n_cols":5,"rows_kept":43,"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],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[20,2,20,3],[21,2,21,3],[25,2,25,3],[27,2,27,3],[27,4,27,5],[28,2,28,3],[28,4,28,5],[29,2,29,3],[29,4,29,5],[30,2,30,3],[31,2,31,3],[32,2,32,3],[33,2,33,3],[36,2,36,3],[37,2,37,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465517903316"]
[null,null,"Titolo",null,"Approximation Algorithms for Combinatorial Optimization [[electronic resource] ] : 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings / / edited by Klaus Jansen, Stefano Leonardi, Vijay Vazirani"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002"]
[null,null,"ISBN",null,"3-540-45753-4"]
[null,null,"Edizione",null,"[1st ed. 2002.]"]
[null,null,"Descrizione fisica",null,"1 online resource (VIII, 276 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 2462"]
[null,null,"Disciplina",null,"004/.01/51"]
[null,null,"Soggetti",null,"Computer programming"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Mathematical optimization"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Optimization"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Numeric Computing"]
[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,"Search and Classification of High Dimensional Data -- Bicriteria Spanning Tree Problems -- Improved Approximation Algorithms for Multilevel Facility Location Problems -- On Constrained Hypergraph Coloring and Scheduling -- On the Power of Priority Algorithms for Facility Location and Set Cover -- Two Approximation Algorithms for 3-Cycle Covers -- Approximation Algorithms for the Unsplittable Flow Problem -- 1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor -- Typical Rounding Problems -- Approximating Min-sum Set Cover -- Approximating Maximum Edge Coloring in Multigraphs -- Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees -- A 27/26-"]
[{"$nulls":4},"Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs -- Facility Location and the Geometric Minimum-Diameter Spanning Tree -- Improved Approximation Algorithms for the Partial Vertex Cover Problem -- Minimum Restricted Diameter Spanning Trees -- Hardness of Approximation for Vertex-Connectivity Network-Design Problems -- Non-abusiveness Helps: An % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2CaeHbuLwBLnhiov2DGi1BTfMBaeHb % d9wDYLwzYbItLDharqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbb % L8F4rqqrFfpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpe % pae9pg0FirpepeKkFr0xfr-xfr-xb9adbaqaaeGaciGaaiaadeWaaq % aadaqbaaGcbaGaaGOmamaaCaaaleqabaGagiiBaWMaei4Ba8Maei4z % aCgaaOWaaWbaaSqabeaadaahaaadbeqaamaaBaaabaWaaWbaaeqaba % GaaGymaiabgkHiTiabgIGiodaaaeqaaaaaaaGcdaahaaWcbeqaaiab % d6gaUbaaaaa!4546! \\[ 2^{\\log } ^{^{_{^{1 - \\in } } } } ^n \\] (1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem -- Routing and Admission Control in Networks with Advance Reservations -- Improved Approximation Algorithms for Metric Facility Location Problems -- Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products -- Primal-Dual Algorithms for Connected Facility Location Problems."]
[null,"2.","Record Nr.",null,"UNINA9910711250003321"]
[null,null,"Autore",null,"Drayer Dennis E"]
[null,null,"Titolo",null,"A compilation of the physical equilibria and related properties of the hydrogen-carbon monoxide system / / Dennis E. Drayer"]
[null,null,"Pubbl/distr/stampa",null,"Gaithersburg, MD : , : U.S. Dept. of Commerce, National Institute of Standards and Technology, , 1961"]
[null,null,"Descrizione fisica",null,"1 online resource"]
[null,null,"Collana",null,"NBS technical note ; ; 108"]
[null,null,"Soggetti",null,"Carbon monoxide"]
[{"$nulls":4},"Hydrogen"]
[{"$nulls":4},"Vapor-liquid equilibrium"]
[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","1961."]
[{"$nulls":4},"Contributed record: Metadata reviewed, not verified. Some fields updated by batch processes."]
[{"$nulls":4},"Title from PDF title page."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]