Produktbild: WALCOM: Algorithms and Computation

WALCOM: Algorithms and Computation 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

31.01.2021

Herausgeber

Ryuhei Uehara + weitere

Verlag

Springer

Seitenzahl

334

Maße (L/B/H)

23,5/15,5/1,8 cm

Gewicht

534 g

Auflage

1st ed. 2021

Sprache

Englisch

ISBN

978-3-030-68210-1

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

31.01.2021

Herausgeber

Verlag

Springer

Seitenzahl

334

Maße (L/B/H)

23,5/15,5/1,8 cm

Gewicht

534 g

Auflage

1st ed. 2021

Sprache

Englisch

ISBN

978-3-030-68210-1

Herstelleradresse

Springer Nature Customer Service Center GmbH
Europaplatz 3
69115 Heidelberg
DE
ProductSafety@springernature.com

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: WALCOM: Algorithms and Computation
  • Invited talks.- Majority Spanning Trees, Cotrees and Their Applications.- New Transportation Problem on a Graph with Sending and Bringing-Back Operations.- Long papers.- Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees.- On Short Fastest Paths in Temporal Graphs.- Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights.- The Bike Sharing Problem.- Efficient Generation of a Card-based Uniformly Distributed Random Derangement.- Compact Data Structures for Dedekind Groups and Finite Rings.- Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game.- Faster Multi-Sided Boundary Labelling.- On the Geometric Red-Blue Set Cover Problem.- Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes.- $r$-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes.- An Improvement of Reed's Treewidth Approximation.- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs.- Overall and delay complexity of the CLIQUESand Bron-Kerbosch algorithms.- Computing $L(p,1)$-Labeling with Combined Parameters.- On Compatible Matchings.- Upward Point Set Embeddings of Paths and Trees.- 2-colored Point-set Embeddings of Partial 2-trees.- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs.- APX-Hardness and Approximation for the $k$-Burning Number Problem.- Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs.- Physical Zero-Knowledge Proof for Ripple Effect.- Cyclic Shift Problems on Graphs.- Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles.