Sciweavers

9572 search results - page 18 / 1915
» Cover Algorithms and Their Combination
Sort
View
IPL
2011
112views more  IPL 2011»
13 years 2 months ago
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
Hiroki Morizumi
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
13 years 7 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin
FSKD
2005
Springer
101views Fuzzy Logic» more  FSKD 2005»
14 years 1 months ago
Geometrical Probability Covering Algorithm
Abstract. In this paper, we propose a novel classification algorithm, called geometrical probability covering (GPC) algorithm, to improve classification ability. On the basis of ...
Junping Zhang, Stan Z. Li, Jue Wang
CSC
2008
13 years 9 months ago
Efficient and Effective Practical Algorithms for the Set-Covering Problem
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
Qi Yang, Jamie McPeek, Adam Nofsinger
FOCS
2005
IEEE
14 years 1 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...