1480 search results - page 28 / 296 » Distributed algorithms for weighted problems in sparse graph... |
174
Voted
SIROCCO
1997
15 years 4 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
91
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
119
Voted
SDM
2007
SIAM
15 years 4 months ago
2007
SIAM
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
126
Voted
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
124
Voted
APPROX
2008
Springer
15 years 4 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...