402 search results - page 3 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
87
Voted
EUSFLAT
2003
2003
Improving interpretability in approximative fuzzy models via multi-objective evolutionary algorithms
15 years 5 months ago
137
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
117
Voted
CDES
2006
15 years 5 months ago
2006
The ability to improve the yield of integrated circuits through layout modification has been recognized and several techniques for yield enhanced routing and compaction have been ...
142
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...