2137 search results - page 116 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
165
click to vote
WADS
2007
Springer
15 years 11 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
130
Voted
INFORMS
2008
15 years 5 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
173
click to vote
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
157
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
125
Voted
CORR
2011
Springer
14 years 12 months ago
2011
Springer
Distributing spatially located heterogeneous workloads is an important problem in parallel scientific computing. We investigate the problem of partitioning such workloads (repres...