Approximating Alternative Solutions

DOI10.1007/978-3-540-69733-6_21zbMath1148.68386OpenAlexW1496432831MaRDI QIDQ3511329

Harald Hempel, Michael Krüger

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the minimum maximal independence number
• The Steiner problem with edge lengths 1 and 2
• Optimization, approximation, and complexity classes
• Approximating MAPs for belief networks is NP-hard and other theorems
• Edge Dominating Sets in Graphs
• On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• The Traveling Salesman Problem with Distances One and Two

This page was built for publication: Approximating Alternative Solutions