Approximating Alternative Solutions

DOI10.1007/978-3-540-69733-6_21MaRDI QIDQ3511329zbMATH OpenOpenAlexFDO

Authors Michael Krüger, Harald Hempel

Publication date 10 July 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69733-6_21

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 139919
• A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
• scientific article; zbMATH DE number 742979
• New approximation algorithms for the Steiner tree problems
• On the approximability of the Steiner tree problem.

Cites work

• Approximating MAPs for belief networks is NP-hard and other theorems
• Approximating the minimum maximal independence number
• Edge Dominating Sets in Graphs
• scientific article; zbMATH DE number 3576997 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 751135 (Why is no real title available?)
• scientific article; zbMATH DE number 1445376 (Why is no real title available?)
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
• Optimization, approximation, and complexity classes
• The Steiner problem with edge lengths 1 and 2
• The Traveling Salesman Problem with Distances One and Two

Cited in

(1)

• scientific article; zbMATH DE number 7312915 (Why is no real title available?)

This page was built for publication: Approximating Alternative Solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511329)