2698 search results - page 228 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
163
click to vote
TAPIA
2003
ACM
15 years 11 months ago
2003
ACM
In this paper we present an infeasible path-following interiorpoint algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as ...
161
click to vote
MFCS
2007
Springer
16 years 21 days ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
170
click to vote
DMIN
2006
15 years 8 months ago
2006
Discovering accurate and interesting classification rules is a significant task in the post-processing stage of a data mining (DM) process. Therefore, an optimization problem exis...
159
click to vote
IJCAI
2003
15 years 8 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
164
click to vote
COLT
2007
Springer
16 years 22 days ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...