6562 search results - page 14 / 1313 » Noetherianity and Combination Problems |
134
Voted
MST
2010
14 years 10 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
275
Voted
GECCO
2011
Springer
14 years 7 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
159
Voted
FLAIRS
2009
15 years 1 months ago
2009
This paper describes a novel application of text categorization for mathematical word problems, namely Multiplicative Compare and Equal Group problems. The empirical results and a...
154
Voted
JAIR
2010
14 years 10 months ago
2010
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, i...
136
Voted
SIAMNUM
2011
14 years 10 months ago
2011
We derive energy-norm a posteriori error bounds for an Euler timestepping method combined with various spatial discontinuous Galerkin schemes for linear parabolic problems. For acc...