824 search results - page 14 / 165 » Weighted Low-Rank Approximations |
166
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
266
click to vote
CP
2009
Springer
16 years 6 months ago
2009
Springer
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
156
click to vote
ISAAC
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
157
Voted
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
176
click to vote
AICT
2005
IEEE
15 years 11 months ago
2005
IEEE
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...