Merkzettel Warenkorb
Produktbild: Frontiers of Algorithmics
Band 15828

Frontiers of Algorithmics 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings

Aus der Reihe Lecture Notes in Computer Science

73,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Lieferung nach Hause

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

30.06.2025

Herausgeber

Vincent Chau + weitere

Verlag

Springer Singapore

Seitenzahl

416

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

651 g

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-981-9683-11-6

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

30.06.2025

Herausgeber

Verlag

Springer Singapore

Seitenzahl

416

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

651 g

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-981-9683-11-6

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: Frontiers of Algorithmics

  • Domination in Diameter Two Graphs and the 2 Club Cluster Vertex Deletion Parameter.- $k$-Universality of Regular Languages Revisited.- Comparing the Hardness of Online Minimization and Maximization Problems with Predictions.- Complexity Classes for Online Problems with and without Predictions.- Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model.- Mixed Graph Covering with Target Constraints.- Multiplication of 0-1 matrices via clustering.- From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances.- Exact Algorithms for the Maximum $k$-Balanced Weighted Biclique Problem.- Approximation Algorithms for Individual Preference Facility Location.- The online power cover problem on a line.- The Subinterval Cover Problem.- Oblivious Robots Under Round Robin: Gathering on Rings.- Finding a Set of Long Common Substrings with Repeats from m Input Strings.- A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties.- Less-excludable Mechanism for DAOs in Public Good Auctions.- TBDS: Transaction-Based Data Sharing.- Pure Nash Equilibria of Weighted Picking Sequence Protocol is WEF1 for Two Agents.- A Comparative Study of Waitlist Mechanisms: Deferral Versus Pay-Per-Offer.- Optimal Repurchasing Contract Design for Efficient Utilization of Computing Resources.- Characterizing Strategyproofness Through Score Functions in Voting Mechanisms.- Minimizing Blocking Agents for Stable Matching with Partial Approval Information.- The Capacity-Constrained Facility Location Problem with Ordinal Preferences: Algorithmic and Mechanism Design Perspectives.- Regularized Minimax-V Learning for Solving Randomly Terminating Two-player Zero-sum Markov Games.- Improved Approximation of Maximin Share Fair Allocation under Generalized Assignment Constraints.- Optimal Hiring Strategy in Auction-Based Crowdsourcing Systems.- Large-Scale Contextual Market Equilibrium Computation through Deep Learning.- Fair Value Distribution in Cooperative Committee Election.- A Payoff-Based Policy Gradient Method in Stochastic Games with Long-Run Average Payoffs.- Mechanism Design for Auctions with Externalities on Budgets.