Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms and Computation [[electronic resource] ] : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings / / edited by Xiaotie Deng, Dingzhu Du
| Algorithms and Computation [[electronic resource] ] : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings / / edited by Xiaotie Deng, Dingzhu Du |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XX, 1190 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer programming Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Computer networks Theory of Computation Programming Techniques Numerical Analysis Discrete Mathematics in Computer Science Computer Communication Networks |
| ISBN | 3-540-32426-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465545203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings / / edited by Xiaotie Deng, Dingzhu Du
| Algorithms and Computation : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings / / edited by Xiaotie Deng, Dingzhu Du |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XX, 1190 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer programming Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Computer networks Theory of Computation Programming Techniques Numerical Analysis Discrete Mathematics in Computer Science Computer Communication Networks |
| ISBN | 3-540-32426-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910484526303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Optimization and Applications [[electronic resource] ] : 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings / / edited by Ding-Zhu Du, Donglei Du, Chenchen Wu, Dachuan Xu
| Combinatorial Optimization and Applications [[electronic resource] ] : 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings / / edited by Ding-Zhu Du, Donglei Du, Chenchen Wu, Dachuan Xu |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (726 pages) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Data structures (Computer science) Information theory Computer science - Mathematics Artificial intelligence Computer graphics Theory of Computation Data Structures and Information Theory Mathematics of Computing Artificial Intelligence Computer Graphics |
| ISBN | 3-030-92681-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Routing among Convex Polygonal Obstacles in the Plane -- Target Coverage with Minimized Number of Camera Sensors -- Two-Stage Submodular Maximization under Curvature -- An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem -- The Selection of COVID-19 Epidemic Prevention and Control Programs Based on Group Decision Making -- Which Option is a Better Way to Improve Transfer Learning Performance ? -- On Maximizing the Difference between an Approximately Submodular Function and a Linear Function Subject to a Matroid Constraint -- On Various Open-End Bin Packing Game -- A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions -- Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints -- Computing the One-Visibility Cop-Win Strategies for Trees -- Complexity and Approximation Results on the Shared Transportation Problem -- The complexity of finding optimal subgraphs to represent spatial correlation -- New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem -- Evolutionary Equilibrium Analysis for Decision on Block Size in Blockchain Systems -- Efficient Algorithms for Scheduling Parallel Jobs with Interval Constraints in Clouds -- Two-Stage Stochastic Max-Weight Independent Set Problems -- Routing and Scheduling Problems with Two Agents on a Line-Shaped Network -- The Price of Anarchy of Generic Valid Utility Systems -- Single Machine Scheduling with Rejection and Generalized Parameters -- Approximation Algorithm and Hardness Results for Defensive Domination in Graphs -- An Improved Physical ZKP for Nonogram -- Finding All Leftmost Separators of Size $\leq k$ -- Maximize the Probability of Union-Influenced in Social Networks -- A Novel Algorithm for Max Sat Calling MOCE to Order -- The Smallest Number of Vertices in a 2-Arc-Strong Digraph without Pair of Arc-Disjoint in- and out-Branchings -- Generalized Self-Profit Maximization in Attribute Networks -- Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-Hierarchy Classes -- Maximization of Monotone Non-Submodular Functions with a Knapsack Constraint over the Integer Lattice -- Sublinear-time Reductions for Big Data Computing -- Capacitated Partial Inverse Maximum Spanning Tree under the Weighted $l_{\infty}$-Norm -- Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems -- Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs -- Streaming Submodular Maximization under Differential Privacy Noise -- Online Bottleneck Semi-Matching -- Optimal Due Date Assignment without Restriction and Convex Resource Allocation in Group Technology Scheduling -- Constrained Stable Marriage with Free edges or Few Blocking Pairs -- Backgammon is Hard -- Two-Facility Location Games with a Minimum Distance Requirement on a Circle -- Open Shop Scheduling Problem with a Non-Resumable Flexible Maintenance Period -- Parallel Algorithm For Minimum Partial Dominating Set In Unit Disk Graph -- An Improved Approximation Algorithm for Squared Metric k-Facility Location -- Parameterized Algorithms for Linear Layouts of Graphs with Respect to the Vertex Cover Number -- The Fractional k-Truncated Metric Dimension of Graphs -- On Structural Parameterizations of the Offensive Alliance Problem -- On the k-colored Rainbow Sets in Fixed Dimensions -- Cycle-Connected Mixed Graphs and Related Problems -- Directed width parameters on semicomplete digraphs -- Improved Parameterized Approximation for Balanced k-Median -- A LP-Based Approximation Algorithm for Generalized Traveling Salesperson Path Problem -- Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs -- Approximation Algorithm for Min-Max Correlation Clustering Problem with Outliers -- Delay-Constrained Minimum Shortest Path Trees and Related Problems -- On the Feedback Number of 3-Uniform Linear Extremal Hypergraph -- A Multi-Pass Streaming Algorithm for Regularized Submodular Maximization. |
| Record Nr. | UNISA-996464426703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Optimization and Applications : 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings / / edited by Ding-Zhu Du, Donglei Du, Chenchen Wu, Dachuan Xu
| Combinatorial Optimization and Applications : 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings / / edited by Ding-Zhu Du, Donglei Du, Chenchen Wu, Dachuan Xu |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (726 pages) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Data structures (Computer science) Information theory Computer science - Mathematics Artificial intelligence Computer graphics Theory of Computation Data Structures and Information Theory Mathematics of Computing Artificial Intelligence Computer Graphics |
| ISBN | 3-030-92681-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Routing among Convex Polygonal Obstacles in the Plane -- Target Coverage with Minimized Number of Camera Sensors -- Two-Stage Submodular Maximization under Curvature -- An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem -- The Selection of COVID-19 Epidemic Prevention and Control Programs Based on Group Decision Making -- Which Option is a Better Way to Improve Transfer Learning Performance ? -- On Maximizing the Difference between an Approximately Submodular Function and a Linear Function Subject to a Matroid Constraint -- On Various Open-End Bin Packing Game -- A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions -- Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints -- Computing the One-Visibility Cop-Win Strategies for Trees -- Complexity and Approximation Results on the Shared Transportation Problem -- The complexity of finding optimal subgraphs to represent spatial correlation -- New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem -- Evolutionary Equilibrium Analysis for Decision on Block Size in Blockchain Systems -- Efficient Algorithms for Scheduling Parallel Jobs with Interval Constraints in Clouds -- Two-Stage Stochastic Max-Weight Independent Set Problems -- Routing and Scheduling Problems with Two Agents on a Line-Shaped Network -- The Price of Anarchy of Generic Valid Utility Systems -- Single Machine Scheduling with Rejection and Generalized Parameters -- Approximation Algorithm and Hardness Results for Defensive Domination in Graphs -- An Improved Physical ZKP for Nonogram -- Finding All Leftmost Separators of Size $\leq k$ -- Maximize the Probability of Union-Influenced in Social Networks -- A Novel Algorithm for Max Sat Calling MOCE to Order -- The Smallest Number of Vertices in a 2-Arc-Strong Digraph without Pair of Arc-Disjoint in- and out-Branchings -- Generalized Self-Profit Maximization in Attribute Networks -- Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-Hierarchy Classes -- Maximization of Monotone Non-Submodular Functions with a Knapsack Constraint over the Integer Lattice -- Sublinear-time Reductions for Big Data Computing -- Capacitated Partial Inverse Maximum Spanning Tree under the Weighted $l_{\infty}$-Norm -- Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems -- Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs -- Streaming Submodular Maximization under Differential Privacy Noise -- Online Bottleneck Semi-Matching -- Optimal Due Date Assignment without Restriction and Convex Resource Allocation in Group Technology Scheduling -- Constrained Stable Marriage with Free edges or Few Blocking Pairs -- Backgammon is Hard -- Two-Facility Location Games with a Minimum Distance Requirement on a Circle -- Open Shop Scheduling Problem with a Non-Resumable Flexible Maintenance Period -- Parallel Algorithm For Minimum Partial Dominating Set In Unit Disk Graph -- An Improved Approximation Algorithm for Squared Metric k-Facility Location -- Parameterized Algorithms for Linear Layouts of Graphs with Respect to the Vertex Cover Number -- The Fractional k-Truncated Metric Dimension of Graphs -- On Structural Parameterizations of the Offensive Alliance Problem -- On the k-colored Rainbow Sets in Fixed Dimensions -- Cycle-Connected Mixed Graphs and Related Problems -- Directed width parameters on semicomplete digraphs -- Improved Parameterized Approximation for Balanced k-Median -- A LP-Based Approximation Algorithm for Generalized Traveling Salesperson Path Problem -- Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs -- Approximation Algorithm for Min-Max Correlation Clustering Problem with Outliers -- Delay-Constrained Minimum Shortest Path Trees and Related Problems -- On the Feedback Number of 3-Uniform Linear Extremal Hypergraph -- A Multi-Pass Streaming Algorithm for Regularized Submodular Maximization. |
| Record Nr. | UNINA-9910513691603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Optimization and Applications [[electronic resource] ] : Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings / / edited by Boting Yang, Ding-Zhu Du, Cao An Wang
| Combinatorial Optimization and Applications [[electronic resource] ] : Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings / / edited by Boting Yang, Ding-Zhu Du, Cao An Wang |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XII, 480 p.) |
| Disciplina | 519.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer networks Computer science Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Programming Techniques Computer Communication Networks Theory of Computation Discrete Mathematics in Computer Science Numerical Analysis |
| ISBN | 3-540-85097-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Going Weighted: Parameterized Algorithms for Cluster Editing -- Parameterized Graph Editing with Chosen Vertex Degrees -- Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries -- Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets -- Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems -- A Parameterized Perspective on Packing Paths of Length Two -- New Algorithms for k-Center and Extensions -- Separating Sublinear Time Computations by Approximate Diameter -- Computational Study on Dominating Set Problem of Planar Graphs -- Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region -- Parameterized Algorithms for Generalized Domination -- Turán Graphs, Stability Number, and Fibonacci Index -- Vertex-Uncertainty in Graph-Problems -- Protean Graphs with a Variety of Ranking Schemes -- Simplicial Powers of Graphs -- On k- Versus (k?+?1)-Leaf Powers -- Flows with Unit Path Capacities and Related Packing and Covering Problems -- Strong Formulations for 2-Node-Connected Steiner Network Problems -- Algorithms and Implementation for Interconnection Graph Problem -- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order -- Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks -- Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks -- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems -- Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph -- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem -- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs -- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem -- Covering Arrays Avoiding Forbidden Edges -- The Robot Cleans Up -- On Recovering Syntenic Blocks from Comparative Maps -- Automatic Generation of Symmetry-Breaking Constraints -- On the Stable Set Polytope of Claw-Free Graphs -- A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs -- Magic Labelings on Cycles and Wheels -- Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs -- The Clique Corona Operation and Greedoids -- On the Surface Area of the (n, k)-Star Graph -- Enumerating Isolated Cliques in Synthetic and Financial Networks -- A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem -- Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays -- Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization -- Stochastic Online Scheduling Revisited -- Delay Management Problem: Complexity Results and Robust Algorithms -- Clustered SplitsNetworks. |
| Record Nr. | UNISA-996465891903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Optimization and Applications [[electronic resource] ] : Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings / / edited by Boting Yang, Ding-Zhu Du, Cao An Wang
| Combinatorial Optimization and Applications [[electronic resource] ] : Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings / / edited by Boting Yang, Ding-Zhu Du, Cao An Wang |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XII, 480 p.) |
| Disciplina | 519.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer networks Computer science Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Programming Techniques Computer Communication Networks Theory of Computation Discrete Mathematics in Computer Science Numerical Analysis |
| ISBN | 3-540-85097-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Going Weighted: Parameterized Algorithms for Cluster Editing -- Parameterized Graph Editing with Chosen Vertex Degrees -- Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries -- Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets -- Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems -- A Parameterized Perspective on Packing Paths of Length Two -- New Algorithms for k-Center and Extensions -- Separating Sublinear Time Computations by Approximate Diameter -- Computational Study on Dominating Set Problem of Planar Graphs -- Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region -- Parameterized Algorithms for Generalized Domination -- Turán Graphs, Stability Number, and Fibonacci Index -- Vertex-Uncertainty in Graph-Problems -- Protean Graphs with a Variety of Ranking Schemes -- Simplicial Powers of Graphs -- On k- Versus (k?+?1)-Leaf Powers -- Flows with Unit Path Capacities and Related Packing and Covering Problems -- Strong Formulations for 2-Node-Connected Steiner Network Problems -- Algorithms and Implementation for Interconnection Graph Problem -- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order -- Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks -- Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks -- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems -- Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph -- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem -- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs -- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem -- Covering Arrays Avoiding Forbidden Edges -- The Robot Cleans Up -- On Recovering Syntenic Blocks from Comparative Maps -- Automatic Generation of Symmetry-Breaking Constraints -- On the Stable Set Polytope of Claw-Free Graphs -- A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs -- Magic Labelings on Cycles and Wheels -- Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs -- The Clique Corona Operation and Greedoids -- On the Surface Area of the (n, k)-Star Graph -- Enumerating Isolated Cliques in Synthetic and Financial Networks -- A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem -- Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays -- Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization -- Stochastic Online Scheduling Revisited -- Delay Management Problem: Complexity Results and Robust Algorithms -- Clustered SplitsNetworks. |
| Record Nr. | UNINA-9910484381903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computing and Combinatorics [[electronic resource] ] : 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings / / edited by Dachuan Xu, Donglei Du, Dingzhu Du
| Computing and Combinatorics [[electronic resource] ] : 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings / / edited by Dachuan Xu, Donglei Du, Dingzhu Du |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVI, 785 p. 109 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer networks Computer science Artificial intelligence Discrete Mathematics in Computer Science Computer Communication Networks Theory of Computation Computer Science Logic and Foundations of Programming Artificial Intelligence |
| ISBN | 3-319-21398-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms and data structures -- Algorithmic game theory; approximation algorithms and online algorithms -- Automata, languages, logic and computability -- Complexity theory -- Computational learning theory -- Cryptography, reliability and security -- Database theory, computational biology and bioinformatics -- Computational algebra, geometry, number theory, graph drawing and information visualization -- Graph theory, communication networks, optimization and parallel and distributed computing. |
| Record Nr. | UNISA-996198512503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics : 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings / / edited by Dachuan Xu, Donglei Du, Dingzhu Du
| Computing and Combinatorics : 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings / / edited by Dachuan Xu, Donglei Du, Dingzhu Du |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVI, 785 p. 109 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer networks Computer science Artificial intelligence Discrete Mathematics in Computer Science Computer Communication Networks Theory of Computation Computer Science Logic and Foundations of Programming Artificial Intelligence |
| ISBN | 3-319-21398-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms and data structures -- Algorithmic game theory; approximation algorithms and online algorithms -- Automata, languages, logic and computability -- Complexity theory -- Computational learning theory -- Cryptography, reliability and security -- Database theory, computational biology and bioinformatics -- Computational algebra, geometry, number theory, graph drawing and information visualization -- Graph theory, communication networks, optimization and parallel and distributed computing. |
| Record Nr. | UNINA-9910484381103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theoretical Computer Science [[electronic resource] ] : 35th National Conference, NCTCS 2017, Wuhan, China, October 14-15, 2017, Proceedings / / edited by Dingzhu Du, Lian Li, En Zhu, Kun He
| Theoretical Computer Science [[electronic resource] ] : 35th National Conference, NCTCS 2017, Wuhan, China, October 14-15, 2017, Proceedings / / edited by Dingzhu Du, Lian Li, En Zhu, Kun He |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Singapore : , : Springer Singapore : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XXI, 356 p. 165 illus.) |
| Disciplina | 004 |
| Collana | Communications in Computer and Information Science |
| Soggetto topico |
Algorithms
Computer logic Mathematical logic Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 981-10-6893-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms and Complexity -- Software Theory and Method -- Data Science and Machine Learning Theory -- Parallel and Distributed Computing -- Computational Model. |
| Record Nr. | UNINA-9910254846603321 |
| Singapore : , : Springer Singapore : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and applications of models of computation : 17th annual conference, TAMC 2022, Tianjin, China, September 16-18, 2022, proceedings / / Ding-Zhu Du [and three others], (editors)
| Theory and applications of models of computation : 17th annual conference, TAMC 2022, Tianjin, China, September 16-18, 2022, proceedings / / Ding-Zhu Du [and three others], (editors) |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (427 pages) |
| Disciplina | 511.3 |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computational complexity
Computer science - Mathematics |
| ISBN | 3-031-20350-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Maximization of k-Submodular Function with a Matroid Constraint -- 1 Introduction -- 2 Preliminaries -- 3 Main Results for nMkSM -- 3.1 A Deterministic Algorithm for nMkSM -- 3.2 A Random Algorithm for nMkSM -- References -- Maximizing Approximately Non-k-Submodular Monotone Set Function with Matroid Constraint -- 1 Introduction -- 2 Preliminaries -- 3 Greedy Algorithm and Analysis -- 3.1 Greedy Algorithm -- 4 Discussion -- References -- Time-of-Use Scheduling Problem with Equal-Length Jobs -- 1 Introduction -- 1.1 Related Works -- 1.2 Problem Definition -- 1.3 Our Contribution -- 2 Preliminaries -- 3 General Instance -- 4 Agreeable Deadlines Jobs -- 5 Conclusion -- References -- Online Weakly DR-Submodular Optimization with Stochastic Long-Term Constraints*-12pt -- 1 Introduction -- 2 Preliminaries -- 3 Problem Statement -- 4 Algorithm and Performance Analysis -- 5 Conclusion -- References -- Physical ZKP for Makaro Using a Standard Deck of Cards -- 1 Introduction -- 1.1 Zero-Knowledge Proof -- 1.2 Related Work -- 1.3 Our Contribution -- 2 Preliminaries -- 2.1 Pile-Shifting Shuffle -- 2.2 Pile-Scramble Shuffle -- 3 Main Protocol -- 3.1 Cell Cards -- 3.2 Verifying Room Condition -- 3.3 Encoding Sequences -- 3.4 Conversion from Cell Cards to Encoding Sequences -- 3.5 Verifying Neighbor Condition -- 3.6 Verifying Arrow Condition -- 3.7 Complexity -- 4 Proof of Correctness and Security -- 5 Future Work -- References -- Characterization of the Imbalance Problem on Complete Bipartite Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Imbalance on Complete Bipartite Graphs -- 4 Imbalance on Chained Complete Bipartite Graphs -- 4.1 Proof of the Upper Bound -- 4.2 Proof of the Lower Bound -- References -- New Algorithms for a Simple Measure of Network Partitioning -- 1 Introduction -- 1.1 Related Work.
1.2 Our Results -- 2 The Greedy Cut Algorithm -- 2.1 The Algorithm -- 2.2 Analysis -- 3 Experiments -- 4 Conclusions -- References -- On Two Types of Concept Lattices in the Theory of Numberings -- 1 Introduction -- 2 Preliminaries -- 3 The First Approach: Capturing the Cardinality of a Family -- 3.1 Proof of Theorem 3.1 -- 3.2 Classification via Index Sets -- 4 The Second Approach: Realizing All Countable Complete Lattices -- 4.1 Uncountable Lattices -- 5 Further Discussion -- A Proof of Theorem 3.3 -- B Proof of Theorem4.1 -- References -- Computing Connected-k-Subgraph Cover with Connectivity Requirement -- 1 Introduction -- 1.1 Related Works -- 1.2 Contribution -- 2 Algorithm for MinCkSCcon in Terms of Treewidth -- 2.1 Basic Notations -- 2.2 MinCkSCcon on Bounded Treewidth Graphs -- 3 Sub-exponential FPT Algorithm for MinCkSCcon on H-minor-free Graphs -- 4 Conclusion -- References -- Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs -- 1 Introduction -- 2 Related Work -- 3 Computational Complexity -- 4 Approximation Algorithm -- 5 Approximation Complexity -- 6 Conclusion -- References -- Competition-Based Generalized Self-profit Maximization in Dual-Attribute Networks -- 1 Introduction -- 2 Problem Formulation -- 2.1 Dual-Attribute Compete Model and Diffusion Dynamics -- 2.2 Problem Statements -- 3 The Algorithm -- 3.1 Model Influence Probability -- 3.2 Find Candidate Solutions -- 3.3 Sandwich Approximation -- 4 Experiment -- 5 Conclusion -- References -- Largest Convex Hulls for Constant Size, Convex-Hull Disjoint Clusters -- 1 Introduction -- 1.1 Our Results -- 2 Algorithms for a Set of Disjoint Clusters of Size Two -- 2.1 An Overview -- 2.2 Optimum Solution of an Atomic Problem -- 2.3 Solving MPCH(U, s, t) for Point Clusters in Convex Position -- 2.4 Solving MPCH(U, s, t) for Arbitrarily Given Points -- 3 Extension. References -- Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 Two-Stage Submodular Maximization Subject to Knapsack and K-Matroid Constraints -- 4.1 The Algorithm -- 4.2 The Analysis -- 5 Two-Stage Submodular Maximization Subject to Knapsack and k-exchange System Constraints -- 5.1 The Algorithm -- 5.2 The Analysis -- 6 Conclusion -- A Appendix -- References -- (Z,succ,U), (Z,E,U), and Their CSP's -- 1 Introduction -- 2 Preliminaries -- 3 A Sufficient Condition for Efficiency of CSP(Z,succ,U) -- 4 Bounds and Characterization of CSP(Z,succ,U) -- 4.1 ``Lower Bounding'' CSP(Z,succ,U) -- 4.2 Karp-Equivalent Characterizations of CSP(Z,succ,U) -- 5 From (Z,succ,U) to (Z,E,U) -- 6 Future Directions -- A Proof Details of Interesting Claims -- A.1 Details of Section3, Proposition 1 and Corollary 1 -- A.2 Details of Section3, Theorem 1 and Corollary 2 -- A.3 Details of Section4, Proposition 2 and Corollary 3 -- A.4 Details of Section4, Theorem 2 -- A.5 Details of Section5, Fact 3 and Proposition 4 -- B Diagrams Summarizing Main Results -- B.1 For Section4 -- B.2 For Section5 -- C Detailed Verification of Miscellaneous Claims -- C.1 Full Details of Section3, Observation 1 -- C.2 Section3 Equation1 Gives the L.U.B. in Karp-Order -- C.3 More Discussion on Diffd -- C.4 Figure4 Disproves Converse of Proposition3([struct1]1) -- C.5 Definition of Connectedness in General Case (Re. Comments at Beginning of Section5) -- C.6 Verification of Corollary 4 -- C.7 Remark on Further Generalizing Sect.5 -- C.8 More Discussion on Future Directions -- References -- Circle Graph Isomorphism in Almost Linear Time -- 1 Introduction -- 2 Minimal Split Decomposition and Split Trees -- 3 Canonization of Graph-Labeled Trees -- 4 Canonization of Prime and Degenerate Circle Graphs -- 5 Proof of Theorem 1. References -- The Exact Subset MultiCover Problem -- 1 Introduction -- 2 The Exact Subset MultiCover Problem -- 3 The Exclusive Exact Subset MultiCover Problem -- 4 The Max-EESM Problem -- 5 Conclusion -- References -- Hide a Liar: Card-Based ZKP Protocol for Usowan -- 1 Introduction -- 2 Preliminaries -- 2.1 Pile-shifting Shuffle ch17ShinagawaIEICE2017,ch17NishimuraIEICE18 -- 2.2 Mizuki-Sone Copy Protocol ch17MizukiFAW09 -- 2.3 Input-preserving Five-Card Trick ch17MiyaharaFUN2020 -- 2.4 How to Form a White Polyomino ch17RobertNGCO2022 -- 2.5 Sum in Zch17RuangwisesTCS2021 -- 3 ZKP Protocol for Usowan -- 3.1 Setup Phase -- 3.2 Connectivity Phase -- 3.3 Verification Phases -- 4 Conclusion -- A Mizuki-Sone Copy Protocol ch17MizukiFAW09 -- B Input-preserving Five-Card Trick ch17MiyaharaFUN2020 -- C How to Form a White Polyomino -- C.1 Chosen Pile Protocol ch17DumasCOCOON2019 -- C.2 Sub-protocol: 4-Neighbour Protocol ch17RobertNGCO2022 -- C.3 Full Protocol -- D Security Proofs -- References -- Complexity Analysis of a Stochastic Variant of Generalized Alternating Direction Method of Multipliers -- 1 Introduction -- 2 Stochastic Linearized Generalized ADMM -- 3 Complexity Analysis of SLG-ADMM -- 3.1 A Worst-Case O(1/k) Convergence Rate -- 3.2 A Worst-Case O(lnk/k) Convergence Rate Under Strong Convexity -- 4 Conclusion -- References -- A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem -- 1 Introduction -- 2 Definitions and Basic Properties -- 3 Approximation for Even Instances -- 4 Approximation for Odd Instances -- References -- Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs -- 1 Introduction -- 2 Preliminaries -- 2.1 Graphs -- 2.2 Chordal Graphs and Split Graphs -- 2.3 Subset Feedback Vertex Set in Chordal Graphs -- 2.4 A Technique for Algorithm Design. 3 Reductions Between R-SFVS in Chordal Graphs and Vertex Cover -- 4 A Fast Exact Algorithm for R-SFVS in Chordal Graphs -- 4.1 Max Independent Set Based on Edge Clique Cover -- 4.2 Some Reduction Rules -- 4.3 A Special Case -- 4.4 Subset Feedback Vertex Set in Chordal Graphs -- 5 Conclusion -- References -- An Approximation Algorithm for the B-prize-collecting Multicut Problem in Trees -- 1 Introduction -- 2 Preliminaries -- 3 The Increasing Penalty Algorithm -- 4 Conclusions and Future Work -- References -- Two-Stage Non-submodular Maximization -- 1 Introduction -- 2 Preliminaries -- 3 Problem (2.1) Under a Matroid Constraint -- 3.1 Algorithm -- 3.2 Theoretical Analysis -- 4 Conclusion -- References -- Fault-Tolerant Total Domination via Submodular Function Approximation -- 1 Introduction -- 2 Preliminaries -- 3 General Greedy Submodular Approximation -- 4 Fault-Tolerant Total Domination -- 4.1 Total Domination -- 4.2 Fault-Tolerant Total Domination -- 5 Conclusions -- References -- On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems -- 1 Introduction -- 2 Statement of Problems -- 2.1 The Constraint-Required Read-Once Refutation (CROR) Problem -- 2.2 The Minimum Weight Perfect Matching (MWPM) Problem -- 2.3 Complexity Classes -- 3 Motivation and Related Work -- 4 The CROR Problem in UTVPI Constraints -- 5 Conclusion -- References -- Extracting Densest Sub-hypergraph with Convex Edge-Weight Functions -- 1 Introduction -- 2 Properties of Edge-Weight Functions -- 3 GDSH with Convex Edge-Weight Functions -- 3.1 A Linear Program Approach -- 3.2 A Network Flow Algorithm -- 3.3 A Fast 1r-approximation Algorithm -- 4 Non-convex Edge-Weight Functions -- 5 Conclusion -- A Missing Proof of Lemma 1 -- B Detailed Proof of Theorem 1 -- C Missing Proof of Lemma 3 -- D Missing Proof to Theorem 3. E Missing Proof of Theorem 5. |
| Record Nr. | UNINA-9910637713503321 |
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||