667 search results - page 53 / 134 » Approximation algorithms for connected facility location pro... |
92
Voted
COCOON
2008
Springer
15 years 2 months ago
2008
Springer
Given two sets of points in the plane, we are interested in locating a highway h such that an objective function on the city distance between points of the two sets is minimized (w...
99
Voted
IPCO
2010
15 years 1 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
103
Voted
STACS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
138
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
101
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...