• Produktbild: Algorithmic Aspects in Information and Management
  • Produktbild: Algorithmic Aspects in Information and Management
Band 15179

Algorithmic Aspects in Information and Management 18th International Conference, AAIM 2024, Virtual Event, September 21–23, 2024, Proceedings, Part I

63,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

19.09.2024

Herausgeber

Smita Ghosh + weitere

Verlag

Springer Singapore

Seitenzahl

288

Maße (L/B/H)

23,5/15,5/1,7 cm

Gewicht

464 g

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-981-9777-97-6

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

19.09.2024

Herausgeber

Verlag

Springer Singapore

Seitenzahl

288

Maße (L/B/H)

23,5/15,5/1,7 cm

Gewicht

464 g

Auflage

1. Auflage

Sprache

Englisch

ISBN

978-981-9777-97-6

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: Algorithmic Aspects in Information and Management
  • Produktbild: Algorithmic Aspects in Information and Management
  • .- Optimization and Applications.

    .- Maximum Core Spanning Tree Insertion Maintenance for Large Dynamic Graphs.

    .- NFTO: DAG-Based Task Offloading and Energy Optimization Algorithm in Mobile Edge Computing.

    .- Approximation Algorithm for the Maximum Interval Multi-Cover Problem.

    .- Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network.

    .- Efficient Approximation Algorithms for Parallel Batch Machine Scheduling of Malleable Jobs.

    .- Cost-sharing mechanisms for the selfish open-end bin packing problem.

    .- ToI-based Data Utility Maximization for UAV-assisted Wireless Sensor Networks.

    .- Parity-Constrained Weighted k-Center.

    .- Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters.

    .- Dynamic DR-Submodular Maximization with Linear Costs over the Integer Lattice.

    .- A distributed approximation algorithm for the total dominating set problem.

    .- Revisit the online facility location problem with uniform facility cost.

    .- or-Submodular maximization under a Matroid Constraint and a Knapsack Constraint.

    .- A Distributed Method for Negative Content Spread Minimization on Social Networks.

    .- Approximation Algorithms for the Minimum Weight Cycle/Path Partition Problem.

    .- Iterative rounding for bag of tasks scheduling with rejection in high performance computing.

    .- Optimization and Applications.

    .- Integrated airline aircraft routing and crew pairing by alternating Lagrangian decomposition.

    .- Monotone Submodular Meta-Learning under the Matroid Constraint.

    .- Submodular Participatory Budgeting.

    .- Approximation Algorithms for $k$-Submodular Maximization under the Fair Constraints and Size Constraints.

    .- Systematic Review of Cybersecurity Disclosure Research.

    .- Revisiting the stretch factor of Delaunay triangulations of points in convex position.

    .- Transition-based Heterogeneous Network Embedding by Self-Attention Model of Sparse Matrix.