191
click to vote
ICALP
15 years 10 months ago
2005 Springer 
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
132
Voted
ICALP
15 years 10 months ago
2005 Springer 
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
162
click to vote
ICALP
15 years 10 months ago
2005 Springer 
Abstract. We present a Hoare logic for a simple imperative whilelanguage with stored commands, ie. stored parameterless procedures. Stores that may contain procedures are called hi...
141
Voted
ICALP
15 years 10 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...
162
Voted
ICALP
15 years 10 months ago
2005 Springer 
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
|
Programming Languages