4118 search results - page 6 / 824 » Efficient Algorithms for Airline Problem |
AICOM
2004
13 years 8 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
SIAMCOMP
1998
13 years 8 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
SODA
1994
ACM
13 years 10 months ago
1994
ACM
ESOP
2009
Springer
14 years 12 days ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...