Identifying gene regulatory networks from experimental data
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Information and Computation
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures & Algorithms
Automated mechanism design: complexity results stemming from the single-agent setting
ICEC '03 Proceedings of the 5th international conference on Electronic commerce
Investigation of Maximum and Minimum Satisfiability Problems Using L-Partition
Automation and Remote Control
Self-interested automated mechanism design and implications for optimal combinatorial auctions
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Subset-conjunctive rules for breast cancer diagnosis
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Optimization problems in multiple-interval graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On reoptimizing multi-class classifiers
Machine Learning
Polynomial-TimeMaximisation Classes: Syntactic Hierarchy
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
On the Minimum Hitting Set of Bundles Problem
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
On the minimum hitting set of bundles problem
Theoretical Computer Science
Multi-step multi-sensor hider-seeker games
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Subset-conjunctive rules for breast cancer diagnosis
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms (TALG)
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Frameworks for logically classifying polynomial-time optimisation problems
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Minimum satisfiability and its applications
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
On dependent randomized rounding algorithms
Operations Research Letters
Optimizing with minimum satisfiability
Artificial Intelligence
Polynomial-TimeMaximisation Classes: Syntactic Hierarchy
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Aggregating conditionally lexicographic preferences on multi-issue domains
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
This paper shows that a minimization version of satisfiability is strongly NP-hard, even if each clause contains no more than two literals and/or each clause contains at most one unnegated variable. The worst-case and average-case performances of greedy and probabilistic greedy heuristics for the problem are examined, and tight upper bounds on the performance ratio in each case are developed.