Info
Combinatorial Optimization and Applications [[electronic resource] ] : 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012, Proceedings / / edited by Guohui Lin
| Combinatorial Optimization and Applications [[electronic resource] ] : 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012, Proceedings / / edited by Guohui Lin |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XI, 398 p. 111 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks |
| ISBN | 3-642-31770-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465279003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics [[electronic resource] ] : 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings / / edited by Guohui Lin
| Computing and Combinatorics [[electronic resource] ] : 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings / / edited by Guohui Lin |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XII, 572 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Discrete mathematics Computer networks Artificial intelligence—Data processing Computer graphics Theory of Computation Discrete Mathematics in Computer Science Computer Communication Networks Data Science Computer Graphics |
| ISBN | 3-540-73545-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Combinatorics of Sequencing the Corn Genome -- Online Frequency Assignment in Wireless Communication Networks -- Information Distance from a Question to an Answer -- A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy -- A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem -- Seed-Based Exclusion Method for Non-coding RNA Gene Search -- A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method -- Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data -- Improved Exact Algorithms for Counting 3- and 4-Colorings -- Connected Coloring Completion for General Graphs: Algorithms and Complexity -- Quadratic Kernelization for Convex Recoloring of Trees -- On the Number of Cycles in Planar Graphs -- An Improved Exact Algorithm for Cubic Graph TSP -- Geometric Intersection Graphs: Do Short Cycles Help? -- Dimension, Halfspaces, and the Density of Hard Sets -- Isolation Concepts for Enumerating Dense Subgraphs -- Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O(n 4) Time -- Counting Minimum Weighted Dominating Sets -- Online Interval Scheduling: Randomized and Multiprocessor Cases -- Scheduling Selfish Tasks: About the Performance of Truthful Algorithms -- Volume Computation Using a Direct Monte Carlo Method -- Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks -- Generating Minimal k-Vertex Connected Spanning Subgraphs -- Finding Many Optimal Paths Without Growing Any Optimal Path Trees -- Enumerating Constrained Non-crossing Geometric Spanning Trees -- Colored Simultaneous Geometric Embeddings -- Properties of Symmetric Incentive Compatible Auctions -- Finding Equilibria in Games of No Chance -- Efficient Testing of Forecasts -- When Does Greedy Learning of Relevant Attributes Succeed? -- The Informational Content of Canonical Disjoint NP-Pairs -- On the Representations of NC and Log-Space Real Numbers -- Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals -- Streaming Algorithms Measured in Terms of the Computed Quantity -- A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem -- Optimal Offline Extraction of Irredundant Motif Bases -- Linear Algorithm for Broadcasting in Unicyclic Graphs -- An Improved Algorithm for Online Unit Clustering -- Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs -- Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions -- On the Hardness of Optimization in Power Law Graphs -- Can a Graph Have Distinct Regular Partitions? -- Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games -- Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates -- On the Complexity of Finding an Unknown Cut Via Vertex Queries -- “Resistant” Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas -- An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity -- Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats -- Priority Algorithms for the Subset-Sum Problem -- Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families -- A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs -- Improved Algorithms for Weighted and Unweighted Set Splitting Problems -- An -Approximation Algorithm for a Hard Variant of Stable Marriage -- Approximation Algorithms for the Black and White Traveling Salesman Problem. |
| Record Nr. | UNISA-996465992103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings / / edited by Guohui Lin
| Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings / / edited by Guohui Lin |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XII, 572 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Discrete mathematics Computer networks Artificial intelligence—Data processing Computer graphics Theory of Computation Discrete Mathematics in Computer Science Computer Communication Networks Data Science Computer Graphics |
| ISBN | 3-540-73545-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Combinatorics of Sequencing the Corn Genome -- Online Frequency Assignment in Wireless Communication Networks -- Information Distance from a Question to an Answer -- A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy -- A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem -- Seed-Based Exclusion Method for Non-coding RNA Gene Search -- A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method -- Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data -- Improved Exact Algorithms for Counting 3- and 4-Colorings -- Connected Coloring Completion for General Graphs: Algorithms and Complexity -- Quadratic Kernelization for Convex Recoloring of Trees -- On the Number of Cycles in Planar Graphs -- An Improved Exact Algorithm for Cubic Graph TSP -- Geometric Intersection Graphs: Do Short Cycles Help? -- Dimension, Halfspaces, and the Density of Hard Sets -- Isolation Concepts for Enumerating Dense Subgraphs -- Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O(n 4) Time -- Counting Minimum Weighted Dominating Sets -- Online Interval Scheduling: Randomized and Multiprocessor Cases -- Scheduling Selfish Tasks: About the Performance of Truthful Algorithms -- Volume Computation Using a Direct Monte Carlo Method -- Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks -- Generating Minimal k-Vertex Connected Spanning Subgraphs -- Finding Many Optimal Paths Without Growing Any Optimal Path Trees -- Enumerating Constrained Non-crossing Geometric Spanning Trees -- Colored Simultaneous Geometric Embeddings -- Properties of Symmetric Incentive Compatible Auctions -- Finding Equilibria in Games of No Chance -- Efficient Testing of Forecasts -- When Does Greedy Learning of Relevant Attributes Succeed? -- The Informational Content of Canonical Disjoint NP-Pairs -- On the Representations of NC and Log-Space Real Numbers -- Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals -- Streaming Algorithms Measured in Terms of the Computed Quantity -- A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem -- Optimal Offline Extraction of Irredundant Motif Bases -- Linear Algorithm for Broadcasting in Unicyclic Graphs -- An Improved Algorithm for Online Unit Clustering -- Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs -- Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions -- On the Hardness of Optimization in Power Law Graphs -- Can a Graph Have Distinct Regular Partitions? -- Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games -- Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates -- On the Complexity of Finding an Unknown Cut Via Vertex Queries -- “Resistant” Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas -- An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity -- Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats -- Priority Algorithms for the Subset-Sum Problem -- Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families -- A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs -- Improved Algorithms for Weighted and Unweighted Set Splitting Problems -- An -Approximation Algorithm for a Hard Variant of Stable Marriage -- Approximation Algorithms for the Black and White Traveling Salesman Problem. |
| Record Nr. | UNINA-9910484703803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||