12519 search results - page 56 / 2504 » Approximation Problems Categories |
111
Voted
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
141
Voted
MOC
2010
14 years 9 months ago
2010
We consider the application of a perfectly matched layer (PML) technique to approximate solutions to the elastic wave scattering problem in the frequency domain. The PML is viewed ...
102
Voted
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
141
Voted
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
129
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...