1725 search results - page 173 / 345 » Relaxed genetic programming |
68
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
CP
2004
Springer
15 years 3 months ago
2004
Springer
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
85
Voted
PAKDD
2004
ACM
15 years 3 months ago
2004
ACM
The use of unlabeled data to aid classification is important as labeled data is often available in limited quantity. Instead of utilizing training samples directly into semi-super...
100
click to vote
ESA
2000
Springer
15 years 1 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
101
click to vote
APPROX
2008
Springer
15 years 10 days ago
2008
Springer
For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...