14158 search results - page 238 / 2832 » Generalized switch-setting problems |
166
click to vote
STACS
1994
Springer
15 years 8 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
158
click to vote
DBPL
2007
Springer
15 years 7 months ago
2007
Springer
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
148
click to vote
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
128
click to vote
ESEM
2008
ACM
15 years 5 months ago
2008
ACM
Some agile voices have been raised against extensive documentation. They advocate its sparse use and production. In this paper, we report from agile evolution and maintenance tren...
137
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...