754 search results - page 32 / 151 » Exact Algorithms for the Vertex Separator Problem in Graphs |
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
ICALP
2009
Springer
14 years 8 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...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
LATIN
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
CPM
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...