Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Improved approximations of packing and covering problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Impossibility results for recycling random bits in two-prover proof systems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A tight analysis of the greedy algorithm for set cover
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)
Splitters and near-optimal derandomization
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation of k-set cover by semi-local optimization
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Provably good routing tree construction with multi-port terminals
Proceedings of the 1997 international symposium on Physical design
Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
On the limits of non-approximability of lattice problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Multicasting in heterogeneous networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the complexity of the view-selection problem
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximating shallow-light trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation bounds for the group Steiner problem
Proceedings of the conference on Design, automation and test in Europe
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
On point covers of c-oriented polygons
Theoretical Computer Science
Combinatorial optimization algorithms for radio network planning
Theoretical Computer Science
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Approximation algorithms for terrain guarding
Information Processing Letters
Detecting Corrupted Pages in M Replicated Large Files
IEEE Transactions on Parallel and Distributed Systems
Local majorities, coalitions and monopolies in graphs: a review
Theoretical Computer Science
The inapproximability of non-NP-hard optimization problems
Theoretical Computer Science
Improved Approximation Algorithms for Capacitated Facility Location Problems
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Max- and Min-Neighborhood Monopolies
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
The Inapproximability of Non NP-hard Optimization Problems
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
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
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On Approximability of the Independent/Connected Edge Dominating Set Problems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
On the Hardness of Approximating Minimum Monopoly Problems
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
A Derandomization Using Min-Wise Independent Permutations
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Toward Optimal Player Weights in Secure Distributed Protocols
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Tree Spanners for Subgraphs and Related Tree Covering Problems
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Budget Constrained Minimum Cost Connected Medians
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Optimizing Cost Flows by Modifying Arc Costs and Capacities
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Bounds for the Minimum Disagreement Problem with Applications to Learning Theory
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Service-constrained network design problems
Nordic Journal of Computing
An efficient distributed algorithm for constructing small dominating sets
Distributed Computing - Special issue: Selected papers from PODC '01
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Finding Essential Attributes from Binary Data
Annals of Mathematics and Artificial Intelligence
On the difficulty of approximately maximizing agreements
Journal of Computer and System Sciences
Multicasting and Broadcasting in Large WDM Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
A derandomization using min-wise independent permutations
Journal of Discrete Algorithms
A 2-approximation NC algorithm for connected vertex cover and tree cover
Information Processing Letters
(Almost) tight bounds and existence theorems for confluent flows
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Selection of Views to Materialize in a Data Warehouse
IEEE Transactions on Knowledge and Data Engineering
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The complexity of base station positioning in cellular networks
Discrete Applied Mathematics
Automatic Subspace Clustering of High Dimensional Data
Data Mining and Knowledge Discovery
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Robust monitoring of link delays and faults in IP networks
IEEE/ACM Transactions on Networking (TON)
Self-improved gaps almost everywhere for the agnostic approximation of monomials
Theoretical Computer Science
Budget optimization in search-based advertising auctions
Proceedings of the 8th ACM conference on Electronic commerce
Automated antenna positioning algorithms for wireless fixed-access networks
Journal of Heuristics
On the minimum monochromatic or multicolored subgraph partition problems
Theoretical Computer Science
Energy efficient multicast routing in ad hoc wireless networks
Computer Communications
Analysis of greedy approximations with nonsubmodular potential functions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Local search study of honeycomb clustering problem for cellular planning
International Journal of Mobile Network Design and Innovation
Universal Attribute Reduction Problem
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
A 5+epsilon (Porson)-approximation algorithm for minimum weighted dominating set in unit disk graph
Theoretical Computer Science
Algorithms for connected set cover problem and fault-tolerant connected set cover problem
Theoretical Computer Science
Universal Problem of Attribute Reduction
Transactions on Rough Sets IX
Greedy Algorithm for Attribute Reduction
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Journal of Discrete Algorithms
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
Greedy Algorithms withWeights for Construction of Partial Association Rules
Fundamenta Informaticae
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Learning first-order definitions of functions
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Construction of component tapes for radial placement machines
Computers and Operations Research
The complexity of base station positioning in cellular networks
Discrete Applied Mathematics
An improved approximation algorithm for vertex cover with hard capacities
Journal of Computer and System Sciences
Greedy approximations for minimum submodular cover with submodular cost
Computational Optimization and Applications
Approximation algorithms for bounded facility location
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On partial covers, reducts and decision rules with weights
Transactions on rough sets VI
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Approximate algorithm for minimization of decision tree depth
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
On partial covers, reducts and decision rules
Transactions on rough sets VIII
On algorithm for building of optimal α-decision trees
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Greedy Algorithm with Weights for Decision Tree Construction
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
Organizing the operation of radial machine sequencers for multiple PCB types
Computers and Industrial Engineering
Decision rules for decision tables with many-valued decisions
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
Theoretical Computer Science
Connected set cover problem and its applications
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Provisioning a virtual private network under the presence of non-communicating groups
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Loop-Based topology maintenance in wireless sensor networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Submodular integer cover and its application to production planning
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Time complexity of decision trees
Transactions on Rough Sets III
On approximation of the submodular set cover problem
Operations Research Letters
Complexity of minimum corridor guarding problems
Information Processing Letters
Greedy Algorithm for Construction of Partial Association Rules
Fundamenta Informaticae
Greedy Algorithms withWeights for Construction of Partial Association Rules
Fundamenta Informaticae
Greedy Algorithm for Attribute Reduction
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
On the union of intermediate nodes of shortest paths
Journal of Combinatorial Optimization
| Hi-index | 0.01 |