Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds

Published 2017 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
Authors
Keywords
-
Journal
SIAM JOURNAL ON COMPUTING
Volume 46, Issue 3, Pages 1029-1061
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Online
2017-06-21
DOI
10.1137/15m1053369

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.