Our website is currently undergoing technical upgrades to serve you better. We’ll be back online shortly.
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Computing and Combinatorics: 28th International Conference, COCOON 2022, Shenzhen, China, October 22–24, 2022, Proceedings(13595 Lecture Notes in Computer Science)
37%
Computing and Combinatorics: 28th International Conference, COCOON 2022, Shenzhen, China, October 22–24, 2022, Proceedings(13595 Lecture Notes in Computer Science)

Computing and Combinatorics: 28th International Conference, COCOON 2022, Shenzhen, China, October 22–24, 2022, Proceedings(13595 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

Chapter(s) “Chapter Name or No.” is/are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Table of Contents:
A stochastic algorithm for non-monotone DR-submodular maximziation over a convex set.- Flow shop scheduling problems with transportation constraints revisited.- LotterySampling: A Randomized Algorithm for the Heavy Hitters and Top-k Problems in Data Streams.- Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants.- Large k-gons in a 1.5D Terrain.- Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits (Extended Abstract).-Analysis of Approximate sorting in I/O model.-Two Generalizations of Proper Coloring: Hardness and Approximability.-Approximation Algorithms for Capacitated Assignment with Budget Constraints and Applications in Transportation Systems.-On the Complexity of Minimum Maximal Acyclic Matchings.-Online non-monotone DR-submodular maximization: 1/4 approximation ratio and sublinear regret.-Fair Division with Minimal Withheld Information in Social Networks.- Facility Location Games with Ordinal Preferences.-Fully Dynamic $k$-Center Clustering with Outliers.-Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search.-Online one-sided smooth function maximization.-Revisiting Maximum Satisfiability and Related Problems in Data Streams.-Turing Machines with Two-level Memory: A Deep Look into the Input/Output Complexity.- A quantum version of Pollard's Rho of which Shor's Algorithm is a particular case.-Single machine scheduling with rejection to minimize the $k$-th power of the makespan.- Escape from the Room.- Algorithms for hard-constraint point processes via discretization.-Space Limited Graph Algorithms on Big Data Counting Cycles on Planar Graphs in Subexponential Time.-Semi-strict chordal digraphs.- Reallocation Problems with Minimum Completion Time.-The bound coverage problem by aligned disks in L1 metric.-Facility Location Games with Group Externalities.- Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs.- Refined Computational Complexities of Hospitals/Residents Problem with Regional Caps.- Customizable Hub Labeling: Properties and Algorithms Linear-Time Algorithm for Paired-Domination on Distance-Hereditary Graphs.-Bounding the Number of Eulerian Tours in Undirected Graphs.- A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables.- A 4-Space Bounded.- Approximation Algorithm \\for Online Bin Packing Problem.-Generalized Sweeping Line Spanners.- Rooting Gene Trees via Phylogenetic Networks.- An evolving network model from clique extension.- Online semi-matching problem with two heterogeneous sensors in a metric space.- Two-Stage BP Maximization under $p$-matroid Constraint.- The Hamiltonian Path Graph is Connected for Simple $s,t$ Paths in Rectangular Grid Graphs.- An $O(n^3)$-Time Algorithm for the Min-Gap.- Unit-Length Job Scheduling Problem.- Approximation Schemes for k-Facility Location.- Improved Deterministic Algorithms for Non-monotone Submodular Maximization.- Distributed Dominating Sets in Interval Graphs.- Optimal Window Queries on Line Segments using the Trapezoidal Search DAG.- On Rotation Distance, Transpositions and Rank Bounded Trees.- Hitting Geometric Objects Online  via  Points in $\mathbb{Z}^d$.- Capacitated Facility Location with Outliers/Penalties Improved Separated Red Blue Center Clustering.- Proper colorability of segment intersection graphs.


Best Sellers


Product Details
  • ISBN-13: 9783031221040
  • Publisher: Springer International Publishing AG
  • Publisher Imprint: Springer International Publishing AG
  • Height: 235 mm
  • No of Pages: 586
  • Returnable: Y
  • Spine Width: 31 mm
  • Weight: 834 gr
  • ISBN-10: 3031221044
  • Publisher Date: 02 Jan 2023
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 13595 Lecture Notes in Computer Science
  • Sub Title: 28th International Conference, COCOON 2022, Shenzhen, China, October 22–24, 2022, Proceedings
  • Width: 155 mm


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
Computing and Combinatorics: 28th International Conference, COCOON 2022, Shenzhen, China, October 22–24, 2022, Proceedings(13595 Lecture Notes in Computer Science)
Springer International Publishing AG -
Computing and Combinatorics: 28th International Conference, COCOON 2022, Shenzhen, China, October 22–24, 2022, Proceedings(13595 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.

Computing and Combinatorics: 28th International Conference, COCOON 2022, Shenzhen, China, October 22–24, 2022, Proceedings(13595 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