Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q222637 / rank
Normal rank
 
Property / author
 
Property / author: Alexander D. Scott / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MAX-2-SAT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2007.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010651583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large induced degenerate subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-coloring in time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for maximum generalized satisfiability problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for MAX-CUT in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting models for 2SAT and 3SAT formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-based heuristics for constraint-satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree clustering for constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasiconvex Analysis of Backtracking Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth of cubic graphs and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Counting 2-Sat Solutions and Colorings with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Max 2-Sat: Easier and Faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to proving upper bounds for MAX-2-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the bisection width of 3- and 4-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Upper Bounds for Maximum Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LP-Designed Algorithm for Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gadgets, Approximation, and Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:48, 28 June 2024

scientific article
Language Label Description Also known as
English
Linear-programming design and analysis of fast algorithms for Max 2-CSP
scientific article

    Statements

    Linear-programming design and analysis of fast algorithms for Max 2-CSP (English)
    0 references
    0 references
    0 references
    14 May 2008
    0 references
    Max cut
    0 references
    Max 2-sat
    0 references
    Max 2-CSP
    0 references
    exact algorithms
    0 references
    linear-programming duality
    0 references
    measure and conquer
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references