Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Maths for computer scientists > Algorithmic Aspects in Information and Management: 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings(13153 Lecture Notes in Computer Science)
37%
Algorithmic Aspects in Information and Management: 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings(13153 Lecture Notes in Computer Science)

Algorithmic Aspects in Information and Management: 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings(13153 Lecture Notes in Computer Science)

          
5
4
3
2
1

Available


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

This book constitutes the proceedings of the 15th International Conference on Algorithmic Aspects in Information and Management, AAIM 2021, which was held online during December 20-22, 2021. The conference was originally planned to take place in Dallas, Texas, USA, but changed to a virtual event due to the COVID-19 pandemic.  The 38 regular papers included in this book were carefully reviewed and selected from 62 submissions. They were organized in the following topical sections: approximation algorithms; scheduling; nonlinear combinatorial optimization; network problems; blockchain, logic, complexity and reliability; and miscellaneous. 

Table of Contents:
Approximation Algorithms.- Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations.- Approximation Algorithm for the Capacitated Correlation Clustering Problem with Penalties.- Approximation algorithms for the maximum bounded connected bipartition problem.- An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem.- On Stochastic k-Facility Location.- The Complexity of Finding a Broadcast Center.- An Online Algorithm for Data Caching Problem in Edge Computing.- Topical part: Scheduling.- Scheduling on Multiple Two-Stage Flowshops with A Deadline.- Single machine scheduling with rejection to minimize the weighted makespan.- Maximizing Energy Efficiency for Charger Scheduling of WRSNs.- A New Branch-and-Price Algorithm for Daily Aircraft Routing and Scheduling Problem.- Optimizing mobile charger scheduling for task-based sensor networks.- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time.- Topical part: Nonlinear Combinatorial Optimization.- Streaming Algorithms for Maximizing DR-submodular Functions with d-Knapsack Constraints.- Stochastic Submodular Probing with State-Dependent Costs.- Bi-criteria Adaptive Algorithms for Supermodular Minimization.- Improved Algorithms for Non-submodular Function Maximization Problem.- Fixed Observation Time-step: Adaptive Influence Maximization.- Measured Continuous Greedy with Differential Privacy.- Topical part: Network Problems.- Robust t-Path Topology Control Algorithm in Wireless Ad Hoc Networks.- Multi-attribute based Influence Maximization in Social Networks.- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks.- A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with Min-Sum Movement.- Time Sensitive Sweep Coverage with Multiple UAVs.- Recursive Merged Community Detection Algorithm based on Node Cluster.- Purchase Preferences -Based Air Passenger Choice Behavior Analysis from Sales Transaction Data.- Topical part: Blockchain, Logic, Complexity and Reliability.- Multi-Window Bitcoin Price Prediction Framework on Blockchain Transaction Graph.- Sensitivity-Based Optimization for Blockchain Selfish Mining.- Design and Implementation of List and Dictionary in XD-M Language.- Reliable Edge Intelligence using JPEG Progressive.- A game-theoretic analysis of deep neural networks.- Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case.- Topical part: Miscellaneous.- The independence numbers of weighted graphs with forbidden cycles.- Wegner's Conjecture on 2-Distance Coloring.- An Efficient Oracle for Counting Shortest Paths in Planar Graphs.- Restrained and total restrained domination in cographs.- An order Approach for the Core Maintenance Problem on Edge-weighted Graphs.- Fixed-parameter Tractability for Book Drawing with Bounded Number of Crossings Per Edge.


Best Sellers


Product Details
  • ISBN-13: 9783030931759
  • Publisher: Springer Nature Switzerland AG
  • Publisher Imprint: Springer Nature Switzerland AG
  • Height: 235 mm
  • No of Pages: 452
  • Returnable: N
  • Series Title: 13153 Lecture Notes in Computer Science
  • Sub Title: 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings
  • Width: 155 mm
  • ISBN-10: 3030931757
  • Publisher Date: 17 Dec 2021
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Series Title: 13153 Lecture Notes in Computer Science
  • Spine Width: 24 mm
  • Weight: 648 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Algorithmic Aspects in Information and Management: 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings(13153 Lecture Notes in Computer Science)
Springer Nature Switzerland AG -
Algorithmic Aspects in Information and Management: 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings(13153 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Algorithmic Aspects in Information and Management: 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings(13153 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA