Del 15161 i serien Lecture Notes in Computer Science

Computing and Combinatorics

30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I

Häftad, Engelska, 2025

AvYong Chen,Xiaofeng Gao,Xiaoming Sun,An Zhang

1 289 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This three-volume set LNCS 15161, 15162 and 15163 constitutes the refereed proceedings of the 30th International Conference, COCOON 2024, held in Shanghai, China, during August 23–25, 2024.The 90 full papers and 6 short papers were carefully reviewed and selected from 277 submissions. COCOON 2024 provided an excellent venue for researchers working in the area of algorithms, theory of computation, computational complexity, and combinatorics related to computing.

Produktinformation

Utgivningsdatum2025-03-06
Mått155 x 235 x 32 mm
Vikt890 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor573
FörlagSpringer Nature Switzerland AG
ISBN9789819610891

Tillhör följande kategorier

.- Can the 1.375 approximation ratio of unsigned genomes distances be improved?..- An optimal absolute approximation algorithm for computing $k$ restricted shortest paths..- On Extensions of Min-k-Union..- Sublinear Algorithms for Scheduling with Chain Precedence Constraints..- Bicriteria approximation algorithms for the unit disk coverage problem..- Private Neural Network Training with Packed Secret Sharing..- k-Balanced Biclique Partition on Signed Bipartite Graphs..- Bi-criteria Sublinear Time Algorithms for Clustering with Outliers in High Dimensions..- On Sorting Signed Permutations by Flanked DCJs..- Approximating the Maximum Weight Cycle/Path Partition in Graphs with Weights One and Two..- Relations between monotone complexity measures based on decision tree complexity..- Minimum sum vertex cover: kernelization and parameterized algorithms..- Facility location game for maximizing the social satisfaction on a line..- Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line..- MPMD on Two Sources with Lookahead..- Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling..- Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design..- 1.6-approximation algorithm for generalized traveling salesman path probem..- Assortment Planning with Sponsored Products..- NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam..- Near-Optimal Algorithm for Supporting Small and Medium-sized Enterprises in Ad Systems..- The Complexity of Distance-$r$ Dominating Set Reconfiguration..- A characterization of uniquely representable two-directional orthogonal ray graphs..- The complexity of strong confl?ict-free vertex-connection k-colorability..- Parameterized Algorithms for Planar 2-layer Drawing by Vertex Splitting on a Given Subset..- Bipartite domination in outerplanar graphs..- Robust Matroid Bandit Optimization against Adversarial Contamination..- Nash equilibrium and price of anarchy for scheduling games based on a mixed coordination mechanism..- Trade-off Between Maximum Flow Time and Energy Intake in EV Charging..- Maximin Share Allocation under Knapsack Constraint..- On the Minimum Edge Bisection of Graph..- Random Schreier graphs as expanders..- Direct Sum Theorems From Fortification..- On Sorting by Unsigned Symmetric Reversals..- Some Results on Critical ($P_5,H$)-free Graphs..- Single machine lot scheduling to minimize maximum weighted completion time..- A Quadratic Vertex Kernel for Diamond-free Edge Deletion..- Graph convexity partizan games..- Almost optimum $\ell$-covering of $\mathbb{Z}_n$..- The Communication Complexity of Distributed Maximization..- Approximately Covering Vertices by Order-5 or Longer Paths..- An FPT Constant-Factor Approximation Algorithm for Correlation Clustering..- A Little Aggression Goes a Long Way..- Monotone Properties of Uncertain Graphs.

Du kanske också är intresserad av

Del 15162

Computing and Combinatorics

Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang

Häftad, 2025

1 289 kr

Del 15163

Computing and Combinatorics

Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang

Häftad, 2025

789 kr

Del 13461

Frontiers of Algorithmic Wisdom

Minming Li, Xiaoming Sun

Häftad, 2023

789 kr

June-Lotus Poetry Calendar 2020: 六月荷诗历

Xiaoming Sun, Yang Shui

Häftad, 2019

439 kr

Theoretical Computer Science

Xiaoming Sun, Kun He, Xiaoyun Chen

Häftad, 2019

739 kr

Del 10628

Combinatorial Optimization and Applications

Xiaofeng Gao, Hongwei Du, Meng Han

Häftad, 2017

739 kr

Del 10627

Combinatorial Optimization and Applications

Xiaofeng Gao, Hongwei Du, Meng Han

Häftad, 2017

739 kr

Nanoseparation Using Density Gradient Ultracentrifugation

Xiaoming Sun, Liang Luo, Yun Kuang, Pengsong Li

Häftad, 2018

799 kr

Del 14752

Frontiers of Algorithmics

Bo Li, Minming Li, Xiaoming Sun

Häftad, 2024

1 079 kr

Del 11640

Algorithmic Aspects in Information and Management

Ding-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang

Häftad, 2019

719 kr

Del 15161 i serien Lecture Notes in Computer Science

Computing and Combinatorics

30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I

Häftad, Engelska, 2025

AvYong Chen,Xiaofeng Gao,Xiaoming Sun,An Zhang

1 289 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum2025-03-06
Mått155 x 235 x 32 mm
Vikt890 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor573
FörlagSpringer Nature Switzerland AG
ISBN9789819610891

Tillhör följande kategorier

.- Can the 1.375 approximation ratio of unsigned genomes distances be improved?..- An optimal absolute approximation algorithm for computing $k$ restricted shortest paths..- On Extensions of Min-k-Union..- Sublinear Algorithms for Scheduling with Chain Precedence Constraints..- Bicriteria approximation algorithms for the unit disk coverage problem..- Private Neural Network Training with Packed Secret Sharing..- k-Balanced Biclique Partition on Signed Bipartite Graphs..- Bi-criteria Sublinear Time Algorithms for Clustering with Outliers in High Dimensions..- On Sorting Signed Permutations by Flanked DCJs..- Approximating the Maximum Weight Cycle/Path Partition in Graphs with Weights One and Two..- Relations between monotone complexity measures based on decision tree complexity..- Minimum sum vertex cover: kernelization and parameterized algorithms..- Facility location game for maximizing the social satisfaction on a line..- Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line..- MPMD on Two Sources with Lookahead..- Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling..- Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design..- 1.6-approximation algorithm for generalized traveling salesman path probem..- Assortment Planning with Sponsored Products..- NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam..- Near-Optimal Algorithm for Supporting Small and Medium-sized Enterprises in Ad Systems..- The Complexity of Distance-$r$ Dominating Set Reconfiguration..- A characterization of uniquely representable two-directional orthogonal ray graphs..- The complexity of strong confl?ict-free vertex-connection k-colorability..- Parameterized Algorithms for Planar 2-layer Drawing by Vertex Splitting on a Given Subset..- Bipartite domination in outerplanar graphs..- Robust Matroid Bandit Optimization against Adversarial Contamination..- Nash equilibrium and price of anarchy for scheduling games based on a mixed coordination mechanism..- Trade-off Between Maximum Flow Time and Energy Intake in EV Charging..- Maximin Share Allocation under Knapsack Constraint..- On the Minimum Edge Bisection of Graph..- Random Schreier graphs as expanders..- Direct Sum Theorems From Fortification..- On Sorting by Unsigned Symmetric Reversals..- Some Results on Critical ($P_5,H$)-free Graphs..- Single machine lot scheduling to minimize maximum weighted completion time..- A Quadratic Vertex Kernel for Diamond-free Edge Deletion..- Graph convexity partizan games..- Almost optimum $\ell$-covering of $\mathbb{Z}_n$..- The Communication Complexity of Distributed Maximization..- Approximately Covering Vertices by Order-5 or Longer Paths..- An FPT Constant-Factor Approximation Algorithm for Correlation Clustering..- A Little Aggression Goes a Long Way..- Monotone Properties of Uncertain Graphs.

Du kanske också är intresserad av

Del 15162

Computing and Combinatorics

Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang

Häftad, 2025

1 289 kr

Del 15163

Computing and Combinatorics

Yong Chen, Xiaofeng Gao, Xiaoming Sun, An Zhang

Häftad, 2025

789 kr

Del 13461

Frontiers of Algorithmic Wisdom

Minming Li, Xiaoming Sun

Häftad, 2023

789 kr

June-Lotus Poetry Calendar 2020: 六月荷诗历

Xiaoming Sun, Yang Shui

Häftad, 2019

439 kr

Theoretical Computer Science

Xiaoming Sun, Kun He, Xiaoyun Chen

Häftad, 2019

739 kr

Del 10628

Combinatorial Optimization and Applications

Xiaofeng Gao, Hongwei Du, Meng Han

Häftad, 2017

739 kr

Del 10627

Combinatorial Optimization and Applications

Xiaofeng Gao, Hongwei Du, Meng Han

Häftad, 2017

739 kr

Nanoseparation Using Density Gradient Ultracentrifugation

Xiaoming Sun, Liang Luo, Yun Kuang, Pengsong Li

Häftad, 2018

799 kr

Del 14752

Frontiers of Algorithmics

Bo Li, Minming Li, Xiaoming Sun

Häftad, 2024

1 079 kr

Del 11640

Algorithmic Aspects in Information and Management

Ding-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang

Häftad, 2019

719 kr

Computing and Combinatorics

30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Du kanske också är intresserad av

Computing and Combinatorics

30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Du kanske också är intresserad av

Computing and Combinatorics

30th International Conference, COCOON 2024, Shanghai, China, August 23–25, 2024, Proceedings, Part I

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Du kanske också är intresserad av