982 search results - page 157 / 197 » Solving Steiner tree problems in graphs to optimality |
85
Voted
FLAIRS
2003
15 years 1 months ago
2003
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
100
click to vote
AAAI
2010
15 years 1 months ago
2010
Lifted inference, handling whole sets of indistinguishable objects together, is critical to the effective application of probabilistic relational models to realistic real world ta...
108
click to vote
ANOR
2005
15 years 12 days ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
115
click to vote
TSP
2008
15 years 11 days ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
107
click to vote
JACM
2000
15 years 8 days ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...