1566 search results - page 112 / 314 » On a Cone Covering Problem |
151
Voted
TALG
2008
15 years 6 months ago
2008
A cost-sharing scheme is a set of rules defining how to share the cost of a service (often computed by solving a combinatorial optimization problem) amongst serviced customers. A ...
236
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
167
click to vote
JGO
2010
15 years 4 months ago
2010
We consider a generalized equilibrium problem involving DC functions which is called (GEP). For this problem we establish two new dual formulations based on Toland-Fenchel-Lagrange...
168
click to vote
TAMC
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
173
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...