1963 search results - page 76 / 393 » The Maximum Solution Problem on Graphs |
WISE
2002
Springer
14 years 1 months ago
2002
Springer
Delta compression techniques are commonly used to succinctly represent an updated version of a file with respect to an earlier one. In this paper, we study the use of delta compr...
ENDM
2007
13 years 8 months ago
2007
Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a b...
DC
2011
12 years 8 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
DAM
1999
13 years 8 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
ATAL
2006
Springer
14 years 15 days ago
2006
Springer
We present a method for transforming the infinite interactive state space of interactive POMDPs (I-POMDPs) into a finite one, thereby enabling the computation of exact solutions. ...