scientific article; zbMATH DE number 6783421
From MaRDI portal
Publication:5365069
zbMath1373.68452MaRDI QIDQ5365069
Kevin P. Costello, Asaf Shapira, Prasad Tetali
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133086
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (6)
An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem ⋮ CHAMP: a multipass algorithm for Max Sat based on saver variables ⋮ Go-MOCE: greedy order method of conditional expectations for Max Sat ⋮ On extensions of the deterministic online model for bipartite matching and max-sat ⋮ Using the method of conditional expectations to supply an improved starting point for CCLS ⋮ Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
This page was built for publication:
