Algorithms and Data Structures by Anna Lubiw - Bookswagon
Home > Science & Mathematics > Mathematics > Algebra > Algorithms and Data Structures
Algorithms and Data Structures

Algorithms and Data Structures


     0     
5
4
3
2
1



International Edition


About the Book

Adjacency Labelling of Planar Graphs (and Beyond).- Algorithms for Explainable Clustering.- On the Spanning and Routing Ratios of the Directed Ѳ6-Graph.- The Minimum Moving Spanning Tree Problem.- Scheduling with Testing on Multiple Identical Parallel Machines.- Online Makespan Minimization With Budgeted Uncertainty.- Pattern Matching in Doubling Spaces.- Reachability Problems for Transmission Graphs.- On Minimum Generalized Manhattan Connections.- HalftimeHash: Modern Hashing without 64-bit Multipliers or Finite Fields.- Generalized Disk Graphs.- A 4-Approximation of the 2π/3 -MST.- Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations.- The Neighborhood Polynomial of Chordal.- Incomplete Directed Perfect Phylogeny in Linear Time.- Euclidean maximum matchings in the plane-----local to global.- Solving Problems on Generalized Convex Graphs via Mim-Width.- Improved Bounds on the Spanning Ratio of the Theta-5 Graph.- Computing Weighted Subset Transversals in H-Free Graphs.- Computing the Fréchet Distance Between Uncertain Curves in One Dimension.- Finding a Largest-Area Triangle in a Terrain in Near-Linear Time.- Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees.- An APTAS for Bin Packing with Clique-graph Conflicts.- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs.- ANN for time series under the Fréchet distance.- Strictly In-Place Algorithms for Permuting and Inverting.- A Stronger Lower Bound on Parametric Minimum Spanning Trees.- Online bin packing of squares and cubes.- Exploration of k-Edge-Deficient Temporal Graphs.- Parameterized Complexity of Categorical Clustering with Size Constraints.- Graph Pricing With Limited Supply.- Fair Correlation Clustering with Global and Local Guarantees.- Better Distance Labeling for Unweighted Planar Graphs.- How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths.- Algorithms for Radius-Optimally Augmenting Trees in a Metric Space.- Upper and Lower Bounds for Fully Retroactive Graph Problem.- Characterization of Super-stable Matching.- Uniform Embeddings for Robinson Similarity Matrices.- Particle-Based Assembly Using Precise Global Control Independent Sets in Semi-random Hypergraphs.- A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs.- Support Optimality and Adaptive Cuckoo Filters.- Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time.- Algorithms for the Line-Constrained Disk Coverage and Related Problems.- A universal cycle for strings with fixed-content (which are also known as multiset permutations).- Routing on Heavy-Path WSPD-Spanners.- Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance.- Diverse Partitions of Colored Points.- Reverse Shortest Path Problem for Unit-Disk Graphs.


Best Sellers



Product Details
  • ISBN-13: 9783030835071
  • Publisher: Springer International Publishing
  • Publisher Imprint: Springer
  • Height: 234 mm
  • No of Pages: 670
  • Spine Width: 35 mm
  • Weight: 1001 gr
  • ISBN-10: 3030835073
  • Publisher Date: 08 Sep 2021
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: 17th International Symposium, Wads 2021, Virtual Event, August 9-11, 2021, Proceedings
  • Width: 156 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Algorithms and Data Structures
Springer International Publishing -
Algorithms and Data Structures
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.

Algorithms and Data Structures

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!