Vor Ort
Merkzettel Warenkorb
Produktbild: Theory and Applications of Models of Computation
Band 16084 - 11%

Theory and Applications of Models of Computation 19th Annual Conference, TAMC 2025, Jinan, China, September 19–21, 2025, Proceedings

Aus der Reihe Lecture Notes in Computer Science
11% sparen

63,99 € UVP 72,59 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

03.01.2026

Abbildungen

XIV, 47 illus., 24 illus. in color., schwarz-weiss Illustrationen, farbige Illustrationen

Herausgeber

Min Li + weitere

Verlag

Springer Singapore

Seitenzahl

416

Maße (L/B/H)

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

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-981-9548-38-5

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

03.01.2026

Abbildungen

XIV, 47 illus., 24 illus. in color., schwarz-weiss Illustrationen, farbige Illustrationen

Herausgeber

Verlag

Springer Singapore

Seitenzahl

416

Maße (L/B/H)

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

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-981-9548-38-5

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

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: Theory and Applications of Models of Computation

  • .- Computational Complexity and Algorithms.

    .- Complexity and Approximation Algorithms for Fixed Charge Transportation Problems.

    .- Closure Properties and Characterizations of TotP.

    .- Fair k-Center Clustering with Minimum Representation Guarantees.

    .- Models of Computation.

    .- Approximate EFX and Effcient Allocations of Chores for Bounded Preferences.

    .- Strategies for Non-Myopic Users in EIP-1559.

    .- A Lookup Table Design Method: Achieving O(1)-query Complexity and No Memory Waste.

    .- Logic and Proof Theory.

    .- On a computability-theoretic approach to Boolean-valued models.

    .- Separation between Walksat and DPLL.

    .- Algorithmic Game Theory.

    .- How to Play Mastermind without Game Master.

    .- Constrained Distributed Heterogeneous Two-Facility Location Problems with Max-Variant Cost.

    .- Truthful Two-Obnoxious-Facility Location Games with Optional Preferences and Minimum Distance Constraint.

    .- Approximating EFX through a New Notion of Fairness.

    .- Parallel and Distributed Computing.

    .- A Distributed Algorithm for Robust Sequential Submodular Optimization in Multi-Robot Systems.

    .- Approximation algorithms for the parallel-machine customer order scheduling with weighted and submodular rejection penalties.

    .- Parallelizing Scheduling Algorithms for Resource Allocation under v-RAN.

    .- Computational Geometry and Graph Theory.

    .- Constructive Upper Bounds on Rectangle Eliminating Number in Grid Graphs.

    .- Some Combinatorial Algorithms on the Eliminating Edge Feedback Number of Hypergraphs.

    .- A space-partition based approach to the 2-center problem in three and higher dimensions.

    .- Combinatorial Optimization.

    .- An LP-rounding Based Algorithm for Hard Capacitated Uniform Facility Location Problem with Soft Penalties.

    .- Prediction-Augmented Mechanism Design for Weighted Facility Location.

    .- Max-Min Four-dispersion Problems.

    .- Generalized Last Open-End Bin Packing Problem.

    .- On the windy k-traveling salesman problem.

    .- Approximating Total E ective Resistance Minimization With Small Budget.

    .- Modified Greedy Algorithm for Monotone Submodular Maximization with Knapsack and Partition Matroid Constraints.

    .- Random Greedy Deployment of Heterogeneous UAVs.

    .- Parameterized Algorithms.

    .- A parameterized approximation algorithm for the diversity-aware l-centrum problem.

    .- An Improved Approximation Algorithm for the k-Supplier Problem with Parameterized Triangle Inequality.

    .- A Quadratic Kernel for fClaw, Diamondg-free Deletion.

    .- Continuous Optimization and Lattice Optimization.

    .- An LP-rounding Based Algorithm for Hard Capacitated Uniform Facility Location Problem with Soft Penalties.

    .- Prediction-Augmented Mechanism Design for Weighted Facility Location.

    .- Max-Min Four-dispersion Problems.

    .- Generalized Last Open-End Bin Packing Problem.

    .- On the windy k-traveling salesman problem.