{"product_id":"computing-and-combinatorics-9789819502141","title":"Computing and Combinatorics","description":"\u003cb\u003eBook Synopsis\u003c\/b\u003e\u003cbr\u003e\u003cp\u003e\u003cstrong\u003e.- Approximation Algorithms.\u003cbr\u003e\u003c\/strong\u003e.- Improved Approximation Algorithms for Combinatorial Contracts with Type Constraints.\u003cbr\u003e.- Approximation Algorithms for the Maximum Connected Submodular Functions.\u003cbr\u003e.- Approximating per-scenario bound for the two-stage stochastic facility location problem.\u003cbr\u003e.- Bilevel adversarial scheduling problem on parallel machines.\u003cbr\u003e.- A Randomized FPT Approximation Algorithm for Sorting Unsigned Genomes by Translocations: Breaking the 1.375 Approximation Barrier.\u003cbr\u003e.- On Online Approximation Algorithms for Two-Stage Bins.\u003cbr\u003e.- An Improved Approximation Algorithm for the Minimum k-Star Partition Problem.\u003cbr\u003e.- Doubly Constrained Fair Clustering for General p-Norms.\u003cbr\u003e\u003cstrong\u003e.- Combinatorial Optimization\u003cbr\u003e\u003c\/strong\u003e.- Discrete Effort Distribution via Regret-Enabled Greedy Algorithm.\u003cbr\u003e.- Improving Local Search for Weighted Partial MaxSAT by Initializing with Historical Information.\u003cbr\u003e.- Regularized Submodular Maximization over Integer Lattice.\u003cbr\u003e.- Adaptive Weighting-based Local Search for Route Number Minimization for Vehicle Routing Problem with Time Windows.\u003cbr\u003e\u003cstrong\u003e.- Computational Complexity.\u003cbr\u003e\u003c\/strong\u003e.- Hunting a rabbit is hard.\u003cbr\u003e.- A Nearly-4 log n Depth Lower Bound for Formulas With Restriction on Top.\u003cbr\u003e.- Average-Case Deterministic Query Complexity of Boolean Functions with Fixed Weight.\u003cbr\u003e.- Optimal Framework for Clustering with Noisy Queries.\u003cbr\u003e\u003cstrong\u003e.- Computational Geometry.\u003cbr\u003e\u003c\/strong\u003e.- Minimum-Membership Geometric Dominating Set: Complexity and Algorithms.\u003cbr\u003e.- New Lower Bound and Algorithm for Online Geometric Hitting Set Problem.\u003cbr\u003e.- Erd?os-Szekeres Maker-Breaker Games.\u003cbr\u003e.- Minimum Membership Geometric Set Cover in the Continuous Setting.\u003cbr\u003e\u003cstrong\u003e.- Economics and Computation.\u003cbr\u003e\u003c\/strong\u003e.- On the Distortion of Multi-winner Election Using Single-Candidate Ballots.\u003cbr\u003e.- Fair and Efficient Graphical Resource Allocation with Matching-Induced Utilities.\u003cbr\u003e.- Equivalence of Connected and Peak-Pit Maximal Condorcet Domains.\u003cbr\u003e.- On the Oscillations in Cournot Games with Best Response Strategies.\u003cbr\u003e.- Simultaneous All-Pay Auctions with Budget Constraints.\u003cbr\u003e.- Online Budget Allocation Maximization Problem on Two Uniform Machines with a Common Due Date.\u003c\/p\u003e","brand":"Springer","offers":[{"title":"Default Title","offer_id":53212848816471,"sku":"9789819502141","price":64.99,"currency_code":"GBP","in_stock":true}],"url":"https:\/\/bookcurl.com\/products\/computing-and-combinatorics-9789819502141","provider":"Book Curl","version":"1.0","type":"link"}