6110 search results - page 209 / 1222 » Approximate Computing |
181
click to vote
PSIVT
2007
Springer
16 years 19 days ago
2007
Springer
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
186
click to vote
ISCC
2005
IEEE
16 years 3 days ago
2005
IEEE
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...
158
click to vote
ICTCS
2005
Springer
16 years 22 hour ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
174
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
166
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...