133 search results - page 8 / 27 » Approximating the Minimum Weight Triangulation |
PDCAT
2005
Springer
14 years 25 days ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
TASE
2010
IEEE
13 years 2 months ago
2010
IEEE
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
ESA
2005
Springer
14 years 26 days ago
2005
Springer
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...