2137 search results - page 60 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
135
Voted
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Seve...
162
click to vote
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
172
Voted
IJCV
2011
14 years 11 months ago
2011
This paper is devoted to the optimization problem of continuous multipartitioning, or multi-labeling, which is based on a convex relaxation of the continuous Potts model. In contr...
148
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
145
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...