2398 search results - page 37 / 480 » Constraint Programming and Graph Algorithms |
STOC
1995
ACM
14 years 21 hour ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
ECML
2005
Springer
14 years 2 months ago
2005
Springer
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
KDD
2005
ACM
14 years 9 months ago
2005
ACM
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two t...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...