Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2728900
Jump to:navigation, search

zbMath0971.68598MaRDI QIDQ2728900

Rolf Niedermeier, Jens Gramm

Publication date: 4 November 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-complete problemsparameterized complexityexact algorithmsMax2SatMaximum Cut


Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (10)

Improved exact algorithms for MAX-SAT ⋮ Improved exact algorithms for mildly sparse instances of MAX SAT ⋮ A new upper bound for Max-2-SAT: A graph-theoretic approach ⋮ Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. ⋮ Worst-case study of local search for MAX-\(k\)-SAT. ⋮ Solving sparse instances of Max SAT via width reduction and greedy restriction ⋮ Exact MAX-2SAT solution via lift-and-project closure ⋮ Efficient branch-and-bound algorithms for weighted MAX-2-SAT ⋮ A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach ⋮ A new algorithm for optimal 2-constraint satisfaction and its implications




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2728900&oldid=15587973"
Category:
  • Pages with script errors
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki