3019 search results - page 39 / 604 » Approximating the Domatic Number |
115
click to vote
ICIP
2000
IEEE
16 years 1 months ago
2000
IEEE
This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1...
IPL
2008
14 years 11 months ago
2008
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
WAOA
2007
Springer
15 years 6 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
LATIN
1998
Springer
15 years 4 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
AAAI
2008
15 years 2 months ago
2008
A domino portrait is an approximation of an image using a given number of sets of dominoes. This problem was first