3096 search results - page 74 / 620 » The Generalized FITC Approximation |
TCS
2008
13 years 8 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
CDC
2008
IEEE
13 years 10 months ago
2008
IEEE
Abstract-- This paper considers the problem of model reduction for controlled systems. The paper considers a dual/adjoint formulation of the general optimization problem to minimiz...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
TACAS
2010
Springer
14 years 1 months ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...