2137 search results - page 83 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
137
Voted
AAIM
2007
Springer
15 years 6 months ago
2007
Springer
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
118
Voted
HYBRID
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This paper addresses a parameter synthesis problem for nonlinear hybrid systems. Considering a set of uncertain parameters and a safety property, we give an algorithm tha...
191
Voted
CP
2009
Springer
16 years 2 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
130
click to vote
JCO
2008
15 years 2 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
81
Voted
NIPS
2003
15 years 3 months ago
2003
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...