17 search results - page 3 / 4 » Constant Ratio Fixed-Parameter Approximation of the Edge Mul... |
SPAA
2004
ACM
13 years 11 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
FOCS
2004
IEEE
13 years 10 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
ALGOSENSORS
2009
Springer
14 years 26 days ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
EOR
2010
13 years 6 months ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
SWAT
2010
Springer
13 years 11 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...