Pages that link to "Item:Q1193517"
From MaRDI portal
The following pages link to A bounded approximation for the minimum cost 2-sat problem (Q1193517):
Displaying 20 items.
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- A new fixed point approach for stable networks and stable marriages (Q1201153) (← links)
- Network flow and 2-satisfiability (Q1317481) (← links)
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662) (← links)
- Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights (Q1575713) (← links)
- On a cutting plane heuristic for the stable roommates problem and its applications (Q1577118) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- The stable roommates problem with short lists (Q1733384) (← links)
- The incremental satisfiability problem for a two conjunctive normal form (Q1744433) (← links)
- Approximating MIN 2-SAT and MIN 3-SAT (Q1780843) (← links)
- Hardness results for multimarginal optimal transport problems (Q2067496) (← links)
- Using binary patterns for counting falsifying assignments of conjunctive forms (Q2520658) (← links)
- The Stable Roommates Problem with Short Lists (Q2819460) (← links)
- On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
- The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification (Q3060204) (← links)
- Combining Traditional Map Labeling with Boundary Labeling (Q3075509) (← links)
- Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) (Q3521946) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311102) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
