Randomized metarounding (extended abstract)
From MaRDI portal
Publication:3191971
DOI10.1145/335305.335312zbMath1296.68163OpenAlexW2032813508MaRDI QIDQ3191971
No author found.
Publication date: 26 September 2014
Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/335305.335312
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (12)
A simple and fast algorithm for convex decomposition in relax-and-round mechanisms ⋮ Truthfulness in advertising? Approximation mechanisms for knapsack bidders ⋮ Unnamed Item ⋮ Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs ⋮ Approximation algorithms for general packing problems and their application to the multicast congestion problem ⋮ Fast approximation of minimum multicast congestion – Implementation VERSUS Theory ⋮ Generalized assignment problem: truthful mechanism design without money ⋮ On routing in VLSI design and communication networks ⋮ Minimizing latency of capacitated \(k\)-tours ⋮ On minimizing the maximum congestion for weighted hypergraph embedding in a cycle ⋮ Packing trees in communication networks ⋮ Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
This page was built for publication: Randomized metarounding (extended abstract)
