133 search results - page 21 / 27 » Approximating the Minimum Weight Triangulation |
GECCO
2003
Springer
13 years 12 months ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
ICALP
2011
Springer
12 years 10 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
IROS
2008
IEEE
14 years 1 months ago
2008
IEEE
— Precise robot positioning is important for many applications in indoor environments. Current solutions to the indoor localization problem are either both unreliable and inaccur...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...