Vor Ort
Merkzettel Warenkorb
Produktbild: Computing and Combinatorics
Band 15161

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

Aus der Reihe Lecture Notes in Computer Science

87,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

06.03.2025

Herausgeber

Yong Chen + weitere

Verlag

Springer Singapore

Seitenzahl

573

Maße (L/B/H)

23,5/15,5/3,2 cm

Gewicht

891 g

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-981-9610-89-1

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

06.03.2025

Herausgeber

Verlag

Springer Singapore

Seitenzahl

573

Maße (L/B/H)

23,5/15,5/3,2 cm

Gewicht

891 g

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-981-9610-89-1

Herstelleradresse

Springer-Verlag GmbH
Tiergartenstr. 17
69121 Heidelberg
DE

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Computing and Combinatorics

  • .- 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.