Placeholder text

Go to cart

Computing and Combinatorics

By Fomin, Fedor V.

Computing and Combinatorics

By Fomin, Fedor V.

0 - Default Title
Description
.- 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.
Product details
Binding:
Paperback
Number of Pages:
384
Release Date:
2025-08-01
Publication Date:
2025-08-01
Publisher:
Springer
Languages:
Original: English
ISBN10:
9819502144
ISBN13:
9789819502141
GPSR Manufacturer Reference:
[email protected]
Weight:
581 g
Height:
155 cm
Width:
235 cm
Thickness:
21 cm
Buy on Amazon
Currently sold out