71 search results - page 15 / 15 » Lower Bounds for Testing Bipartiteness in Dense Graphs |
149
click to vote
HM
2007
Springer
16 years 5 days ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...