Combinatorial Optimization and Applications [[electronic resource] ] : 10th International Conference, COCOA 2016, Hong Kong, China, December 16–18, 2016, Proceedings / / edited by T-H. Hubert Chan, Minming Li, Lusheng Wang |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XV, 793 p. 161 illus.) |
Disciplina | 519.3 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
ISBN | 3-319-48749-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Graph Theory -- Geometric Optimization -- Complexity and Data Structure -- Combinatorial Optimization -- Miscellaneous. |
Record Nr. | UNISA-996465612403316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Combinatorial Optimization and Applications : 10th International Conference, COCOA 2016, Hong Kong, China, December 16–18, 2016, Proceedings / / edited by T-H. Hubert Chan, Minming Li, Lusheng Wang |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XV, 793 p. 161 illus.) |
Disciplina | 519.3 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
ISBN | 3-319-48749-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Graph Theory -- Geometric Optimization -- Complexity and Data Structure -- Combinatorial Optimization -- Miscellaneous. |
Record Nr. | UNINA-9910484311903321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Computing and Combinatorics [[electronic resource] ] : 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings / / edited by Lusheng Wang, Daming Zhu |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XIX, 767 p. 134 illus.) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer networks Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Communication Networks |
ISBN | 3-319-94776-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Constructing Independent Spanning Trees on Bubble-Sort Networks -- Exact Algorithms for Finding Partial Edge-Disjoint Paths -- A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications -- Contextual Dependent Click Bandit Algorithm for Web Recommendation -- LP-based pivoting algorithm for higher-order correlation clustering -- Approximation algorithms for a two-phase knapsack problem -- More Routes for Evacuation -- Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem -- Approximating Global Optimum for Probabilistic Truth Discovery -- Online interval scheduling to maximize total satisfaction -- Properties of Minimal-Perimeter Polyominoes -- Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons -- Polygon Queries for Convex Hulls of Points -- Synergistic Solutions for Merging and Computing Planar Convex Hulls -- Cophenetic Distances: A Near-Linear Time Algorithmic Framework -- Computing Coverage Kernels Under Restricted Settings -- Weak Mitoticity of Bounded Disjunctive and Conjunctive Truth-table Autoreducible Sets -- Approximation algorithms for two-machine ow-shop scheduling with a conflict graph -- On Contact Representations of Directed Planar Graphs -- Computation and Growth of Road Network Dimensions -- Car-Sharing between Two Locations: Online Scheduling with Flexible Advance Bookings -- Directed path-width and directed tree-width of directed co-graphs -- Generalized Graph k-Coloring Games -- On Colorful Bin Packing Games -- Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality -- The Path Set Packing Problem -- Manipulation Strategies for the Rank-Maximal Matching Problem -- Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search -- An FPT Algorithm for Contraction to Cactus -- An approximation framework for bounded facility location problems -- Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect -- Solving the Gene Duplication Feasibility Problem in Linear Time -- An Efficiently Recognisable Subset of Hypergraphic Sequences -- Partial Homology Relations - Satisfiability in terms of Di-Cographs -- Improved Algorithm for Finding the Minimum Cost of Storing and Regenerating Datasets in Multiple Clouds -- Reconfiguring spanning and induced subgraphs -- Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators -- Efficient Enumeration of Bipartite Subgraphs in Graphs -- Bipartite Graphs of Small Readability -- Maximum colorful cliques in vertex-colored graphs -- Partial Sublinear Time Approximation and Inapproximation for Maximum Coverage -- Characterizing Star-PCGs -- Liar's Dominating Set in Unit Disk Graphs -- Minimum Spanning Tree of Line Segments -- Improved learning of k-parities -- On a Fixed Haplotype Variant of the Minimum Error Correction Problem -- Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces -- Amplitude Amplification for Operator Identification and Randomized Classes -- Reconstruction of Boolean Formulas in Conjunctive Normal Form -- A Faster FPTAS for the Subset-Sums Ratio Problem -- A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time -- Non-Determinism Reduces Construction Time in Active Self-Assembly Using an Insertion Primitive -- Minimum Membership Hitting Sets of Axis Parallel Segments -- Minimum Transactions Problem -- Heuristic algorithms for the min-max edge 2-coloring problem -- Geometric Spanners in the MapReduce Model -- SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands -- Lower Bounds for Special Cases of Syntactic Multilinear ABPs -- Approximation Algorithms on Multiple Two-Stage Flowshops -- Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem -- New Bounds for Energy Complexity of Boolean Functions -- Hitting and Covering Partially. |
Record Nr. | UNISA-996465714303316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Computing and Combinatorics : 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings / / edited by Lusheng Wang, Daming Zhu |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XIX, 767 p. 134 illus.) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer networks Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Communication Networks |
ISBN | 3-319-94776-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Constructing Independent Spanning Trees on Bubble-Sort Networks -- Exact Algorithms for Finding Partial Edge-Disjoint Paths -- A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications -- Contextual Dependent Click Bandit Algorithm for Web Recommendation -- LP-based pivoting algorithm for higher-order correlation clustering -- Approximation algorithms for a two-phase knapsack problem -- More Routes for Evacuation -- Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem -- Approximating Global Optimum for Probabilistic Truth Discovery -- Online interval scheduling to maximize total satisfaction -- Properties of Minimal-Perimeter Polyominoes -- Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons -- Polygon Queries for Convex Hulls of Points -- Synergistic Solutions for Merging and Computing Planar Convex Hulls -- Cophenetic Distances: A Near-Linear Time Algorithmic Framework -- Computing Coverage Kernels Under Restricted Settings -- Weak Mitoticity of Bounded Disjunctive and Conjunctive Truth-table Autoreducible Sets -- Approximation algorithms for two-machine ow-shop scheduling with a conflict graph -- On Contact Representations of Directed Planar Graphs -- Computation and Growth of Road Network Dimensions -- Car-Sharing between Two Locations: Online Scheduling with Flexible Advance Bookings -- Directed path-width and directed tree-width of directed co-graphs -- Generalized Graph k-Coloring Games -- On Colorful Bin Packing Games -- Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality -- The Path Set Packing Problem -- Manipulation Strategies for the Rank-Maximal Matching Problem -- Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search -- An FPT Algorithm for Contraction to Cactus -- An approximation framework for bounded facility location problems -- Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect -- Solving the Gene Duplication Feasibility Problem in Linear Time -- An Efficiently Recognisable Subset of Hypergraphic Sequences -- Partial Homology Relations - Satisfiability in terms of Di-Cographs -- Improved Algorithm for Finding the Minimum Cost of Storing and Regenerating Datasets in Multiple Clouds -- Reconfiguring spanning and induced subgraphs -- Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators -- Efficient Enumeration of Bipartite Subgraphs in Graphs -- Bipartite Graphs of Small Readability -- Maximum colorful cliques in vertex-colored graphs -- Partial Sublinear Time Approximation and Inapproximation for Maximum Coverage -- Characterizing Star-PCGs -- Liar's Dominating Set in Unit Disk Graphs -- Minimum Spanning Tree of Line Segments -- Improved learning of k-parities -- On a Fixed Haplotype Variant of the Minimum Error Correction Problem -- Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces -- Amplitude Amplification for Operator Identification and Randomized Classes -- Reconstruction of Boolean Formulas in Conjunctive Normal Form -- A Faster FPTAS for the Subset-Sums Ratio Problem -- A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time -- Non-Determinism Reduces Construction Time in Active Self-Assembly Using an Insertion Primitive -- Minimum Membership Hitting Sets of Axis Parallel Segments -- Minimum Transactions Problem -- Heuristic algorithms for the min-max edge 2-coloring problem -- Geometric Spanners in the MapReduce Model -- SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands -- Lower Bounds for Special Cases of Syntactic Multilinear ABPs -- Approximation Algorithms on Multiple Two-Stage Flowshops -- Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem -- New Bounds for Energy Complexity of Boolean Functions -- Hitting and Covering Partially. |
Record Nr. | UNINA-9910349430803321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Computing and Combinatorics [[electronic resource] ] : 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-19, 2005, Proceedings / / edited by Lusheng Wang |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (XVI, 1000 p.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer networks Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer graphics Computer Communication Networks Data Science Discrete Mathematics in Computer Science Computer Graphics |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Lectures -- Bioinformatics -- Networks -- String Algorithms -- Scheduling -- Complexity -- Steiner Trees -- Graph Drawing and Layout Design -- Quantum Computing -- Randomized Algorithms -- Geometry -- Codes -- Finance -- Facility Location -- Graph Theory -- Graph Algorithms -- Others. |
Record Nr. | UNISA-996466171403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-19, 2005, Proceedings / / edited by Lusheng Wang |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (XVI, 1000 p.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer networks Artificial intelligence - Data processing Computer science - Mathematics Discrete mathematics Computer graphics Computer Communication Networks Data Science Discrete Mathematics in Computer Science Computer Graphics |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Lectures -- Bioinformatics -- Networks -- String Algorithms -- Scheduling -- Complexity -- Steiner Trees -- Graph Drawing and Layout Design -- Quantum Computing -- Randomized Algorithms -- Geometry -- Codes -- Finance -- Facility Location -- Graph Theory -- Graph Algorithms -- Others. |
Record Nr. | UNINA-9910483497603321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management [[electronic resource] ] : Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012, Proceedings / / edited by Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (XVII, 370 p. 77 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Electronic data processing—Management Artificial intelligence—Data processing Discrete Mathematics in Computer Science Mathematics of Computing Theory of Computation IT Operations Data Science |
ISBN | 3-642-29700-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations / Bryan He -- Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs / Jiun-Jie Wang and Xin He -- Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance / Longcheng Liu, Yong Chen, Biao Wu and Enyu Yao -- Voronoi Diagram with Visual Restriction / Chenglin Fan, Jun Luo, Wencheng Wang and Binhai Zhu -- Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region / Xuehou Tan and Bo Jiang -- On Covering Points with Minimum Turns / Minghui Jiang -- On Envy-Free Pareto Efficient Pricing / Xia Hua -- Online Pricing for Multi-type of Items / Yong Zhang, Francis Y. L. Chin and Hing-Fung Ting -- Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines / Yiwei Jiang, Zewei Weng and Jueliang Hu -- Computing Maximum Non-crossing Matching in Convex Bipartite Graphs / Danny Z. Chen, Xiaomin Liu and Haitao Wang -- Algorithms for Bandwidth Consecutive Multicolorings of Graphs / (Extended Abstract) / Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou.
Independent Domination on Tree Convex Bipartite Graphs / Yu Song, Tian Liu and Ke Xu -- On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters / Deshi Ye and Lili Mei -- On Multiprocessor Temperature-Aware Scheduling Problems / Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis and Ioannis Milis -- Online Minimum Makespan Scheduling with a Buffer / Yan Lan, Xin Chen, Ning Ding, György Dósa and Xin Han -- A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing / Richard Beigel and Bin Fu -- Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP / Bin Fu -- Some Remarks on the Incompressibility of Width-Parameterized SAT Instances / Bangsheng Tang -- Kernels for Packing and Covering Problems / (Extended Abstract) / Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang and Zhibiao Yang -- The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter / Junping Zhou and Minghao Yin -- Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations / Chihao Zhang and Hongyang Zhang -- On Editing Graphs into 2-Club Clusters / Hong Liu, Peng Zhang and Daming Zhu. Solving Generalized Optimization Problems Subject to SMT Constraints / Feifei Ma, Jun Yan and Jian Zhang -- Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition / Yanyan Xu, Wei Chen, Kaile Su and Wenhui Zhang -- Zero-Sum Flow Numbers of Regular Graphs / Tao-Ming Wang and Shih-Wei Hu -- More Efficient Parallel Integer Sorting / Yijie Han and Xin He -- Fast Relative Lempel-Ziv Self-index for Similar Sequences / Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung -- A Comparison of Performance Measures via Online Search / Joan Boyar, Kim S. Larsen and Abyayananda Maiti -- Online Exploration of All Vertices in a Simple Polygon / Yuya Higashikawa and Naoki Katoh -- In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs / Minati De, Subhas C. Nandy and Sasanka Roy -- The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs / Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai and Yue-Li Wang -- An Improved Approximation Algorithm for the Bandpass Problem / Weitian Tong, Randy Goebel, Wei Ding and Guohui Lin -- Partial Degree Bounded Edge Packing Problem / Peng Zhang -- Erratum: The Approximability of the Exemplar Breakpoint Distance Problem / Zhixiang Chen, Bin Fu and Binhai Zhu. |
Record Nr. | UNISA-996465995203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|