Approximating Alternative Solutions (Q3511329)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Approximating Alternative Solutions	scientific article

Statements

scholarly article

0 references

Approximating Alternative Solutions (English)

0 references

Michael Krüger

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

10 July 2008

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-69733-6_21

0 references

0 references

Approximating MAPs for belief networks is NP-hard and other theorems

0 references

The Steiner problem with edge lengths 1 and 2

0 references

On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Approximating the minimum maximal independence number

0 references

0 references

0 references

0 references

Optimization, approximation, and complexity classes

0 references

The Traveling Salesman Problem with Distances One and Two

0 references

0 references

Edge Dominating Sets in Graphs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-69733-6_21

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3511329

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3511329&oldid=35063347"