Description

Book Synopsis

.- Approximation Algorithms.
.- Improved Approximation Algorithms for Combinatorial Contracts with Type Constraints.
.- Approximation Algorithms for the Maximum Connected Submodular Functions.
.- Approximating per-scenario bound for the two-stage stochastic facility location problem.
.- Bilevel adversarial scheduling problem on parallel machines.
.- A Randomized FPT Approximation Algorithm for Sorting Unsigned Genomes by Translocations: Breaking the 1.375 Approximation Barrier.
.- On Online Approximation Algorithms for Two-Stage Bins.
.- An Improved Approximation Algorithm for the Minimum k-Star Partition Problem.
.- Doubly Constrained Fair Clustering for General p-Norms.
.- Combinatorial Optimization
.- Discrete Effort Distribution via Regret-Enabled Greedy Algorithm.
.- Improving Local Search for Weighted Partial MaxSAT by Initializing with Historical Information.
.- Regularized Submodular Maximization over Integer Lattice.
.- Adaptive Weighting-based Local Search for Route Number Minimization for Vehicle Routing Problem with Time Windows.
.- Computational Complexity.
.- Hunting a rabbit is hard.
.- A Nearly-4 log n Depth Lower Bound for Formulas With Restriction on Top.
.- Average-Case Deterministic Query Complexity of Boolean Functions with Fixed Weight.
.- Optimal Framework for Clustering with Noisy Queries.
.- Computational Geometry.
.- Minimum-Membership Geometric Dominating Set: Complexity and Algorithms.
.- New Lower Bound and Algorithm for Online Geometric Hitting Set Problem.
.- Erd?os-Szekeres Maker-Breaker Games.
.- Minimum Membership Geometric Set Cover in the Continuous Setting.
.- Economics and Computation.
.- On the Distortion of Multi-winner Election Using Single-Candidate Ballots.
.- Fair and Efficient Graphical Resource Allocation with Matching-Induced Utilities.
.- Equivalence of Connected and Peak-Pit Maximal Condorcet Domains.
.- On the Oscillations in Cournot Games with Best Response Strategies.
.- Simultaneous All-Pay Auctions with Budget Constraints.
.- Online Budget Allocation Maximization Problem on Two Uniform Machines with a Common Due Date.

Computing and Combinatorics

    Product form

    £64.99

    Includes FREE delivery

    Order before 4pm tomorrow for delivery by Sat 1 Aug 2026.

    A Paperback by Fedor V. Fomin

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Computing and Combinatorics by Fedor V. Fomin

      Publisher: Springer
      Publication Date: Publication Date: 26/08/2025
      ISBN13: 9789819502141, 978-9819502141
      ISBN10:
      Also in:
      Mathematical theory of computation

      Description

      Book Synopsis

      .- Approximation Algorithms.
      .- Improved Approximation Algorithms for Combinatorial Contracts with Type Constraints.
      .- Approximation Algorithms for the Maximum Connected Submodular Functions.
      .- Approximating per-scenario bound for the two-stage stochastic facility location problem.
      .- Bilevel adversarial scheduling problem on parallel machines.
      .- A Randomized FPT Approximation Algorithm for Sorting Unsigned Genomes by Translocations: Breaking the 1.375 Approximation Barrier.
      .- On Online Approximation Algorithms for Two-Stage Bins.
      .- An Improved Approximation Algorithm for the Minimum k-Star Partition Problem.
      .- Doubly Constrained Fair Clustering for General p-Norms.
      .- Combinatorial Optimization
      .- Discrete Effort Distribution via Regret-Enabled Greedy Algorithm.
      .- Improving Local Search for Weighted Partial MaxSAT by Initializing with Historical Information.
      .- Regularized Submodular Maximization over Integer Lattice.
      .- Adaptive Weighting-based Local Search for Route Number Minimization for Vehicle Routing Problem with Time Windows.
      .- Computational Complexity.
      .- Hunting a rabbit is hard.
      .- A Nearly-4 log n Depth Lower Bound for Formulas With Restriction on Top.
      .- Average-Case Deterministic Query Complexity of Boolean Functions with Fixed Weight.
      .- Optimal Framework for Clustering with Noisy Queries.
      .- Computational Geometry.
      .- Minimum-Membership Geometric Dominating Set: Complexity and Algorithms.
      .- New Lower Bound and Algorithm for Online Geometric Hitting Set Problem.
      .- Erd?os-Szekeres Maker-Breaker Games.
      .- Minimum Membership Geometric Set Cover in the Continuous Setting.
      .- Economics and Computation.
      .- On the Distortion of Multi-winner Election Using Single-Candidate Ballots.
      .- Fair and Efficient Graphical Resource Allocation with Matching-Induced Utilities.
      .- Equivalence of Connected and Peak-Pit Maximal Condorcet Domains.
      .- On the Oscillations in Cournot Games with Best Response Strategies.
      .- Simultaneous All-Pay Auctions with Budget Constraints.
      .- Online Budget Allocation Maximization Problem on Two Uniform Machines with a Common Due Date.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account