Worst-case analysis of memory allocation algorithms
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
A Combinatorial Problem Related to Multimodule Memory Organizations
Journal of the ACM (JACM)
Approximate Algorithms for the 0/1 Knapsack Problem
Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Improving the latency of 802.11 hand-offs using neighbor graphs
Proceedings of the 2nd international conference on Mobile systems, applications, and services
SSA: a power and memory efficient scheme to multi-match packet classification
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Inter-domain role mapping and least privilege
Proceedings of the 12th ACM symposium on Access control models and technologies
Solving the MAXSAT problem using a multivariate EDA based on Markov networks
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Scalable parallelization of FLAME code via the workqueuing model
ACM Transactions on Mathematical Software (TOMS)
Fast computing reachability labelings for large graphs with high compression rate
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
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
On basic properties of fault-tolerant multi-topology routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Reoptimization of Weighted Graph and Covering Problems
Approximation and Online Algorithms
Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs
Approximation and Online Algorithms
Optimising topical query decomposition
Proceedings of the 2009 workshop on Web Search Click Data
On-line exact shortest distance query processing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Multiple routing configurations for fast IP network recovery
IEEE/ACM Transactions on Networking (TON)
GAMPS: compressing multi sensor data by grouping and amplitude scaling
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Enforcing Confidentiality Constraints on Sensitive Databases with Lightweight Trusted Clients
Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
Using hybrid algorithm for Pareto efficient multi-objective test suite minimisation
Journal of Systems and Software
Property-aware program sampling
Proceedings of the 9th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Scheduling to minimize power consumption using submodular functions
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Hardness of k-Vertex-Connected Subgraph Augmentation Problem
Journal of Combinatorial Optimization
Solving MAX-r-SAT above a tight lower bound
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Multi-document summarization via the minimum dominating set
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
On the complexity of local search for weighted standard set problems
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Approximation algorithms for the capacitated domination problem
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Information Processing Letters
An algorithmic treatment of strong queries
Proceedings of the fourth ACM international conference on Web search and data mining
Incremental construction of k-dominating sets in wireless sensor networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
EF-MPR, a new energy eFficient multi-point relay selection algorithm for MANET
The Journal of Supercomputing
Bucket game with applications to set multicover and dynamic page migration
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Fast computation of reachability labeling for large graphs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Replicated partitioning for undirected hypergraphs
Journal of Parallel and Distributed Computing
On the relative merits of simple local search methods for the MAX-SAT problem
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Capacitated domination: constant factor approximations for planar graphs
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Taming the mobile data deluge with drop zones
IEEE/ACM Transactions on Networking (TON)
MDiag: Mobility-assisted diagnosis for wireless sensor networks
Journal of Network and Computer Applications
Parallel data mining revisited. better, not faster
IDA'12 Proceedings of the 11th international conference on Advances in Intelligent Data Analysis
Opportunistic spatio-temporal event processing for mobile situation awareness
Proceedings of the 7th ACM international conference on Distributed event-based systems
Duty-cycle-aware minimum-energy multicasting in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Simple, polynomial-time, heuristic algorithms for finding approximate solutions to various polynomial complete optimization problems are analyzed with respect to their worst case behavior, measured by the ratio of the worst solution value that can be chosen by the algorithm to the optimal value. For certain problems, such as a simple form of the knapsack problem and an optimization problem based on satisfiability testing, there are algorithms for which this ratio is bounded by a constant, independent of the problem size. For a number of set covering problems, simple algorithms yield worst case ratios which can grow with the log of the problem size. And for the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as 0(n&egr;), where n is the problem size and &egr; 0 depends on the algorithm.