Improved approximations of packing and covering problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Master-Slave Strategy and Polynomial Approximation
Computational Optimization and Applications
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On point covers of c-oriented polygons
Theoretical Computer Science
A mixed-mode BIST scheme based on folding compression
Journal of Computer Science and Technology
A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Absolute o(logm) error in approximating random set covering: an average case analysis
Information Processing Letters
Optimal positioning of active and passive monitoring devices
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Tight approximability results for test set problems in bioinformatics
Journal of Computer and System Sciences
Constant-time distributed dominating set approximation
Distributed Computing
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms (TALG)
Greedy algorithms for on-line set-covering and related problems
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Approximating component selection
WSC '04 Proceedings of the 36th conference on Winter simulation
Completeness in approximation classes beyond APX
Theoretical Computer Science
A soft constraint-based approach to the cascade vulnerability problem
Journal of Computer Security - Special issue on security track at ACM symposium on applied computing 2004
On the differential approximation of MIN SET COVER
Theoretical Computer Science
Association management for data dissemination over wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the production of anorexic plan diagrams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Approximating the online set multicover problems via randomized winnowing
Theoretical Computer Science
TTS: a two-tiered scheduling mechanism for energy conservation in wireless sensor networks
International Journal of Sensor Networks
Consensus Genetic Maps as Median Orders from Inconsistent Sources
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A probabilistic alternative to regression suites
Theoretical Computer Science
Minimizing the stretch when scheduling flows of divisible requests
Journal of Scheduling
Universal Attribute Reduction Problem
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Learning MDP Action Models Via Discrete Mixture Trees
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
Optimally Learning Social Networks with Activations and Suppressions
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Identifying robust plans through plan diagram reduction
Proceedings of the VLDB Endowment
Improved Approximation Algorithms for the Spanning Star Forest Problem
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Universal Problem of Attribute Reduction
Transactions on Rough Sets IX
Greedy Algorithm for Attribute Reduction
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Efficient approximation of min set cover by moderately exponential algorithms
Theoretical Computer Science
Objective reduction in evolutionary multiobjective optimization: Theory and applications
Evolutionary Computation
Greedy Algorithm for Construction of Partial Association Rules
Fundamenta Informaticae
On Construction of Partial Association Rules
RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Absolute o( logm) error in approximating random set covering: an average case analysis
Information Processing Letters
On partial covers, reducts and decision rules
Transactions on rough sets VIII
Optimally learning social networks with activations and suppressions
Theoretical Computer Science
Energy optimization in wireless medical systems using physiological behavior
WH '10 Wireless Health 2010
An algorithmic treatment of strong queries
Proceedings of the fourth ACM international conference on Web search and data mining
Station point optimization of total station in shield tunneling method based on set-covering
ICIRA'10 Proceedings of the Third international conference on Intelligent robotics and applications - Volume Part I
Approximation algorithms for euclidean group TSP
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On partial tests and partial reducts for decision tables
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Greedy differential approximations for min set cover
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Annals of Mathematics and Artificial Intelligence
Survey: A survey on the structure of approximation classes
Computer Science Review
Combinatorial approximation algorithms: a comparative review
Operations Research Letters
Greedy Algorithm for Construction of Partial Association Rules
Fundamenta Informaticae
Greedy Algorithm for Attribute Reduction
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
When does greedy learning of relevant attributes succeed?: a fourier-based characterization
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Behavior-oriented data resource management in medical sensing systems
ACM Transactions on Sensor Networks (TOSN)
Secure local algorithm for establishing a virtual backbone in 3D ad hoc network
International Journal of Networking and Virtual Organisations
The design space of probing algorithms for network-performance measurement
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Greedy algorithms for on-line set-covering and related problems
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Efficient Two Dimensional-IP routing: An incremental deployment design
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient processing of graph similarity queries with edit distance constraints
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.01 |