9842 search results - page 251 / 1969 » The Complexity of the Matching-Cut Problem |
111
Voted
WSC
2007
15 years 2 months ago
2007
In a supply chain, there are wide variety of problems, such as transportation scheduling problems and warehouse location problems. These problems are independently defined as opt...
85
Voted
CSL
2005
Springer
15 years 6 months ago
2005
Springer
Implementations of real number computations have largely been unusable in practice because of their very bad performance, especially in comparison to floating point arithmetic imp...
177
Voted
CP
2009
Springer
16 years 1 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...
110
Voted
QSHINE
2005
IEEE
15 years 6 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
187
Voted
POPL
2003
ACM
16 years 26 days ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...