{"product_id":"computing-and-combinatorics-9789819610891","title":"Computing and Combinatorics","description":"\u003cb\u003eBook Synopsis\u003c\/b\u003e\u003cbr\u003e\u003cp\u003e.- Can the 1.375 approximation ratio of unsigned genomes distances be improved?.\u003cbr\u003e.- An optimal absolute approximation algorithm for computing $k$ restricted shortest paths.\u003cbr\u003e.- On Extensions of Min-k-Union.\u003cbr\u003e.- Sublinear Algorithms for Scheduling with Chain Precedence Constraints.\u003cbr\u003e.- Bicriteria approximation algorithms for the unit disk coverage problem.\u003cbr\u003e.- Private Neural Network Training with Packed Secret Sharing.\u003cbr\u003e.- k-Balanced Biclique Partition on Signed Bipartite Graphs.\u003cbr\u003e.- Bi-criteria Sublinear Time Algorithms for Clustering with Outliers in High Dimensions.\u003cbr\u003e.- On Sorting Signed Permutations by Flanked DCJs.\u003cbr\u003e.- Approximating the Maximum Weight Cycle\/Path Partition in Graphs with Weights One and Two.\u003cbr\u003e.- Relations between monotone complexity measures based on decision tree complexity.\u003cbr\u003e.- Minimum sum vertex cover: kernelization and parameterized algorithms.\u003cbr\u003e.- Facility location game for maximizing the social satisfaction on a line.\u003cbr\u003e.- Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line.\u003cbr\u003e.- MPMD on Two Sources with Lookahead.\u003cbr\u003e.- Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling.\u003cbr\u003e.- Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design.\u003cbr\u003e.- 1.6-approximation algorithm for generalized traveling salesman path probem.\u003cbr\u003e.- Assortment Planning with Sponsored Products.\u003cbr\u003e.- NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam.\u003cbr\u003e.- Near-Optimal Algorithm for Supporting Small and Medium-sized Enterprises in Ad Systems.\u003cbr\u003e.- The Complexity of Distance-$r$ Dominating Set Reconfiguration.\u003cbr\u003e.- A characterization of uniquely representable two-directional orthogonal ray graphs.\u003cbr\u003e.- The complexity of strong confl?ict-free vertex-connection k-colorability.\u003cbr\u003e.- Parameterized Algorithms for Planar 2-layer Drawing by Vertex Splitting on a Given Subset.\u003cbr\u003e.- Bipartite domination in outerplanar graphs.\u003cbr\u003e.- Robust Matroid Bandit Optimization against Adversarial Contamination.\u003cbr\u003e.- Nash equilibrium and price of anarchy for scheduling games based on a mixed coordination mechanism.\u003cbr\u003e.- Trade-off Between Maximum Flow Time and Energy Intake in EV Charging.\u003cbr\u003e.- Maximin Share Allocation under Knapsack Constraint.\u003cbr\u003e.- On the Minimum Edge Bisection of Graph.\u003cbr\u003e.- Random Schreier graphs as expanders.\u003cbr\u003e.- Direct Sum Theorems From Fortification.\u003cbr\u003e.- On Sorting by Unsigned Symmetric Reversals.\u003cbr\u003e.- Some Results on Critical ($P_5,H$)-free Graphs.\u003cbr\u003e.- Single machine lot scheduling to minimize maximum weighted completion time.\u003cbr\u003e.- A Quadratic Vertex Kernel for Diamond-free Edge Deletion.\u003cbr\u003e.- Graph convexity partizan games.\u003cbr\u003e.- Almost optimum $ell$-covering of $mathbb{Z}_n$.\u003cbr\u003e.- The Communication Complexity of Distributed Maximization.\u003cbr\u003e.- Approximately Covering Vertices by Order-5 or Longer Paths.\u003cbr\u003e.- An FPT Constant-Factor Approximation Algorithm for Correlation Clustering.\u003cbr\u003e.- A Little Aggression Goes a Long Way.\u003cbr\u003e.- Monotone Properties of Uncertain Graphs.\u003c\/p\u003e","brand":"Springer","offers":[{"title":"Default Title","offer_id":53212867887447,"sku":"9789819610891","price":66.49,"currency_code":"GBP","in_stock":true}],"url":"https:\/\/bookcurl.com\/products\/computing-and-combinatorics-9789819610891","provider":"Book Curl","version":"1.0","type":"link"}