menu
{ "item_title" : "Latin 2018", "item_author" : [" Michael A. Bender", "Martín Farach-Colton", "Miguel A. Mosteiro "], "item_description" : "The graph tessellation cover number: extremal bounds, efficient algorithms and hardness.- Approximate Correlation Clustering Using Same-Cluster Queries.- Finding tight Hamilton cycles in random hypergraphs faster.- Walking Through Waypoints.- Lower Bounds for Online Matching on the Line.- On the complexity of _nding internally vertex-disjoint long directed paths.- Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets.- A Polynomial Sized Kernel for Tracking Paths Problem.- Time-Space Trade-O_s for Computing Euclidean Minimum Spanning Trees.- Approximate nearest neighbor for lp-spaces (2 ", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/31/977/403/3319774034_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Latin 2018|Michael A. Bender

Latin 2018 : Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

The graph tessellation cover number: extremal bounds, efficient algorithms and hardness.- Approximate Correlation Clustering Using Same-Cluster Queries.- Finding tight Hamilton cycles in random hypergraphs faster.- Walking Through Waypoints.- Lower Bounds for Online Matching on the Line.- On the complexity of _nding internally vertex-disjoint long directed paths.- Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets.- A Polynomial Sized Kernel for Tracking Paths Problem.- Time-Space Trade-O_s for Computing Euclidean Minimum Spanning Trees.- Approximate nearest neighbor for lp-spaces (2

This item is Non-Returnable

Details

  • ISBN-13: 9783319774039
  • ISBN-10: 3319774034
  • Publisher: Springer
  • Publish Date: March 2018
  • Dimensions: 9.21 x 6.14 x 1.79 inches
  • Shipping Weight: 2.75 pounds
  • Page Count: 889

Related Categories

You May Also Like...

    1

BAM Customer Reviews