554 search results - page 23 / 111 » Approximation algorithms and hardness results for labeled co... |
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
UAI
2000
2000
Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning
13 years 9 months ago
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called probabilistic arc consistency, which is both a generalization of...
JACM
2006
13 years 7 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside t...