scientific article; zbMATH DE number 6783422
From MaRDI portal
Publication:5365070
zbMath1373.68455MaRDI QIDQ5365070
Matthias Poloczek, Georg Schnitger
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133087
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items (7)
A novel algorithm for Max Sat calling MOCE to order ⋮ An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem ⋮ Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles ⋮ CHAMP: a multipass algorithm for Max Sat based on saver variables ⋮ On extensions of the deterministic online model for bipartite matching and max-sat ⋮ Simple approximation algorithms for balanced MAX~2SAT ⋮ Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
This page was built for publication:
