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)
Bounds on multiprocessing anomalies and related packing algorithms
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
The performance of query control schemes for the zone routing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
The performance of query control schemes for the zone routing protocol
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
An approximation algorithm to the file allocation problem in computer networks
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Two O (log* k)-Approximation Algorithms for the Asymmetric k-Center Problem
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Self-Timed Resynchronization: A Post-Optimization for Static Multiprocessor Schedules
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Heuristics for Improving the Non-oblivious Local Search for MaxSAT
IBERAMIA '98 Proceedings of the 6th Ibero-American Conference on AI: Progress in Artificial Intelligence
Hardness of Set Cover with Intersection 1
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Approximation Algorithms for Partial Covering Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability
ISAAC '99 Proceedings of the 10th 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
Consistency Based Feature Selection
PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Inferring a Union of Halfspaces from Examples
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On the Power of Priority Algorithms for Facility Location and Set Cover
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Stability of Approximation Algorithms for Hard Optimization Problems
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Towards Making Broadcast Encryption Practical
FC '99 Proceedings of the Third International Conference on Financial Cryptography
Weighted Node Coloring: When Stable Sets Are Expensive
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Rough Sets and Ordinal Classification
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Sharper Bounds for the Hardness of Prototype and Feature Selection
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
DS '00 Proceedings of the Third International Conference on Discovery Science
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
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
On the Approximability of the Minimum Test Collection Problem
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Approximating Minimum Cocolourings
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
A Theoretical Analysis of Query Selection for Collaborative Filtering
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Tight Bound on Johnson's Algoritihm for Max-SAT
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Automatic Camera Placement for Image-Based Modeling
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
Techniques to Encode and Compress Fault Dictionaries
VTS '99 Proceedings of the 1999 17TH IEEE VLSI Test Symposium
Floorplanning optimization with trajectory piecewise-linear model for pipelined interconnects
Proceedings of the 41st annual Design Automation Conference
Tight approximability results for test set problems in bioinformatics
Journal of Computer and System Sciences
Efficient initial solution to extremal optimization algorithm for weighted MAXSAT problem
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Approximation algorithms for covering/packing integer programs
Journal of Computer and System Sciences
New primal-dual algorithms for Steiner tree problems
Computers and Operations Research
Approximability of identifying codes and locating--dominating codes
Information Processing Letters
Topology-aware overlay path probing
Computer Communications
A unified approach to approximating partial covering problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Path hitting in acyclic graphs
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Feedback vertex sets in mesh-based networks
Theoretical Computer Science
Tours of Graphs, Digraphs, and Sequential Machines
IEEE Transactions on Computers
Analysis of Algorithms for the Evaluation of Monotonic Boolean Functions
IEEE Transactions on Computers
Microarchitecture configurations and floorplanning co-optimization
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Approximate clustering of incomplete fingerprints
Journal of Discrete Algorithms
Approximating the online set multicover problems via randomized winnowing
Theoretical Computer Science
Approximating a vehicle scheduling problem with time windows and handling times
Theoretical Computer Science
An experimental study of four typical test suite reduction techniques
Information and Software Technology
Approximating the traffic grooming problem in tree and star networks
Journal of Parallel and Distributed Computing
On Sum Coloring of Graphs with Parallel Genetic Algorithms
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Universal Attribute Reduction Problem
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Parameterized Learnability of k-Juntas and Related Problems
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Computational Study on Dominating Set Problem of Planar Graphs
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Parameterized Algorithms for Generalized Domination
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
The Minimum Substring Cover problem
Information and Computation
Approximation Algorithms and Hardness for Domination with Propagation
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
Stochastic Steiner Tree with Non-uniform Inflation
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
A Θ( logn)-approximation for the set cover problem with set ownership
Information Processing Letters
Improved Upper Bounds for Partial Vertex Cover
Graph-Theoretic Concepts in Computer Science
Universal Problem of Attribute Reduction
Transactions on Rough Sets IX
An efficient algorithm for minimum feedback vertex sets in rotator graphs
Information Processing Letters
Efficient approximation of min set cover by moderately exponential algorithms
Theoretical Computer Science
Independent sets in bounded-degree hypergraphs
Discrete Applied Mathematics
Advanced Engineering Informatics
Approximation of min coloring by moderately exponential algorithms
Information Processing Letters
On the Approximability of Some Haplotyping Problems
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Parameterized learnability of juntas
Theoretical Computer Science
Computational study on planar dominating set problem
Theoretical Computer Science
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
Covering the edges of bipartite graphs using K2,2 graphs
Theoretical Computer Science
Priority algorithms for graph optimization problems
Theoretical Computer Science
An Algorithm to Discover the k-Clique Cover in Networks
EPIA '09 Proceedings of the 14th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Part of Speech (POS) Tag Sets Reduction and Analysis Using Rough Set Techniques
RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Construction of component tapes for radial placement machines
Computers and Operations Research
Notes: On approximating the b-chromatic number
Discrete Applied Mathematics
A sharp threshold for the renameable-Horn and the q-Horn properties
Discrete Applied Mathematics
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Discrete Applied Mathematics
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
A modified greedy algorithm for dispersively weighted 3-set cover
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Complexity of the repeaters allocating problem
Information Processing Letters
Absolute o( logm) error in approximating random set covering: an average case analysis
Information Processing Letters
Simplified tight analysis of Johnson's algorithm
Information Processing Letters
Vertex covering by paths on trees with its applications in machine translation
Information Processing Letters
An improved approximation algorithm for vertex cover with hard capacities
Journal of Computer and System Sciences
Semantic email: theory and applications
Web Semantics: Science, Services and Agents on the World Wide Web
Note: Approximation algorithms for art gallery problems in polygons
Discrete Applied Mathematics
Automation and Remote Control
Paneling architectural freeform surfaces
ACM SIGGRAPH 2010 papers
On two restricted ancestors tree problems
Information Processing Letters
Set covering problems in role-based access control
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
INFOCOM'10 Proceedings of the 29th conference on Information communications
Energy efficient network design tool for green IP/Ethernet networks
ONDM'10 Proceedings of the 14th conference on Optical network design and modeling
Algorithms for the Bin Packing Problem with Conflicts
INFORMS Journal on Computing
Approximate algorithms with generalizing attribute values for k-anonymity
Information Systems
Computers in Biology and Medicine
Changing the rules: a comprehensive approach to theory refinement
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
FPGA implementation of a Greedy algorithm for set covering
RTC'05 Proceedings of the 14th IEEE-NPSS conference on Real time
Set cover algorithms for very large datasets
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Highway dimension, shortest paths, and provably efficient algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Paired approximation problems and incompatible inapproximabilities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Differentially private combinatorial optimization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Rough sets for solving classification problems in computational neuroscience
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Approximation algorithms for NP-hard optimization problems
Algorithms and theory of computation handbook
PTAS for weighted set cover on unit squares
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximation algorithms for intersection graphs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms
Computers and Operations Research
A study of IDDQ subset selection algorithms for bridging faults
ITC'94 Proceedings of the 1994 international conference on Test
Set connectivity problems in undirected graphs and the directed steiner network problem
ACM Transactions on Algorithms (TALG)
Uniform unweighted set cover: The power of non-oblivious local search
Theoretical Computer Science
Min-max coverage in multi-interface networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Optimal sensor placement with signal propagation effects and inhomogeneous coverage preferences
International Journal of Sensor Networks
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Multi-VPN optimization for scalable routing via relaying
IEEE/ACM Transactions on Networking (TON)
Text localization and recognition in complex scenes using local features
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part III
A root cause localization model for large scale systems
HotDep'05 Proceedings of the First conference on Hot topics in system dependability
International Journal of Approximate Reasoning
Sublinear graph approximation algorithms
Property testing
Core-generating discretization for rough set feature selection
Transactions on rough sets XIII
Sublinear graph approximation algorithms
Property testing
Linear-work greedy parallel approximate set cover and variants
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Approximating minimum cost source location problems with local vertex-connectivity demands
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
INFORMS Journal on Computing
Tight approximation bounds for greedy frugal coverage algorithms
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Proceedings of the 48th Design Automation Conference
VC-dimension and shortest path algorithms
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Minimum interval cover and its application to genome sequencing
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Tight bounds on local search to approximate the maximum satisfiability problems
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Bounds on greedy algorithms for MAX SAT
ESA'11 Proceedings of the 19th European conference on Algorithms
ESA'11 Proceedings of the 19th European conference on Algorithms
Hitting sets online and vertex ranking
ESA'11 Proceedings of the 19th European conference on Algorithms
Testing of heuristic methods: a case study of greedy algorithm
CEE-SET'08 Proceedings of the Third IFIP TC 2 Central and East European conference on Software engineering techniques
ABSO: advanced bee swarm optimization metaheuristic and application to weighted MAX-SAT problem
BI'11 Proceedings of the 2011 international conference on Brain informatics
Organizing the operation of radial machine sequencers for multiple PCB types
Computers and Industrial Engineering
Journal of Combinatorial Optimization
Survey: Covering problems in facility location: A review
Computers and Industrial Engineering
Linear programming, width-1 CSPs, and robust satisfaction
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Approximating the traffic grooming problem in tree and star networks
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Defining and measuring policy coverage in testing access control policies
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Inapproximability of the multi-level uncapacitated facility location problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A clustering-based selective probing framework to support internet quality of service routing
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Rough set feature selection methods for case-based categorization of text documents
PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Connected set cover problem and its applications
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
A new approach for solving the maximum clique problem
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
The approximability of the exemplar breakpoint distance problem
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Inapproximability results for the lateral gene transfer problem
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Improved approximation algorithms for MAX NAE-SAT and MAX SAT
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
A better-than-greedy algorithm for k-set multicover
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Minimum data-latency-bound k-sink placement problem in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Improved approximability and non-approximability results for graph diameter decreasing problems
Theoretical Computer Science
An improved simulated annealing algorithm for the maximum independent set problem
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
Interference in cellular networks: the minimum membership set cover problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Oriented coloring: complexity and approximation
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
The pipelined set cover problem
ICDT'05 Proceedings of the 10th international conference on Database Theory
Greedy differential approximations for min set cover
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Randomized greedy: new variants of some classic approximation algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Randomized variants of Johnson's algorithm for MAX SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A network-flow based pin-count aware routing algorithm for broadcast electrode-addressing EWOD chips
Proceedings of the International Conference on Computer-Aided Design
The set cover with pairs problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Covering a set of points with a minimum number of lines
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Tight approximation algorithm for connectivity augmentation problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Approximation problems categories
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Priority algorithms for graph optimization problems
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
Order-preserving transformations and greedy-like algorithms
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Approximating the online set multicover problems via randomized winnowing
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Quantitative and qualitative assessment of QoE for multimedia services in wireless environment
Proceedings of the 4th Workshop on Mobile Video
Improved recombination lower bounds for haplotype data
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Cooperative bees swarm for solving the maximum weighted satisfiability problem
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Highly scalable algorithms for robust string barcoding
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
GRASP with path-relinking for the weighted maximum satisfiability problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Efficient and experimental meta-heuristics for MAX-SAT problems
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Frameworks for logically classifying polynomial-time optimisation problems
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Algorithmics – is there hope for a unified theory?
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Rough set feature selection algorithms for textual case-based classification
ECCBR'06 Proceedings of the 8th European conference on Advances in Case-Based Reasoning
Weighted sum coloring in batch scheduling of conflicting jobs
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
Approximating buy-at-bulk and shallow-light k-Steiner trees
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
Approximating minimum power covers of intersecting families and directed connectivity problems
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
On solving the partial MAX-SAT problem
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Time complexity of decision trees
Transactions on Rough Sets III
Covering analysis of the greedy algorithm for partial cover
Algorithms and Applications
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Approximation algorithms for the k-median problem
Efficient Approximation and Online Algorithms
On algebraic immunity and annihilators
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Approximating the unweighted k-set cover problem: greedy meets local search
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Approximation algorithms for art gallery problems in polygons and terrains
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
The covert set-cover problem with application to network discovery
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Algorithmic aspects of dominator colorings in graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Efficient conditional expectation algorithms for constructing hash families
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Stochastic covering and adaptivity
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Packing-based approximation algorithm for the k-set cover problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
Algorithms for the minimum weight k-fold (connected) dominating set problem
Journal of Combinatorial Optimization
Safe approximation and its relation to kernelization
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Simpler 3/4-approximation algorithms for MAX SAT
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Discrete sensor placement problems in distribution networks
Mathematical and Computer Modelling: An International Journal
Operations Research Letters
Rounding to an integral program
Operations Research Letters
Survey: A survey on the structure of approximation classes
Computer Science Review
Dominance guarantees for above-average solutions
Discrete Optimization
Minimum partition of an independence system into independent sets
Discrete Optimization
Approximation of the Quadratic Set Covering problem
Discrete Optimization
On approximation of the submodular set cover problem
Operations Research Letters
Review of recent development: Probabilistic behaviour of optical bin-packing solutions
Operations Research Letters
Parallel and I/O efficient set covering algorithms
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Pattern Recognition and Image Analysis
Set cover revisited: hypergraph cover with hard capacities
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Strengthening hash families and compressive sensing
Journal of Discrete Algorithms
Greedy Algorithm for Attribute Reduction
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Heuristic for attribute selection using belief discernibility matrix
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
Unordered constraint satisfaction games
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Analysis of approximation algorithms for k-set cover using factor-revealing linear programs
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
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
Independent sets in bounded-degree hypergraphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
FPT algorithms for domination in biclique-free graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Fair solutions for some multiagent optimization problems
Autonomous Agents and Multi-Agent Systems
Secure local algorithm for establishing a virtual backbone in 3D ad hoc network
International Journal of Networking and Virtual Organisations
Approximating minimum cost source location problems with local vertex-connectivity demands
Journal of Discrete Algorithms
On bounding node-to-sink latency in wireless sensor networks with multiple sinks
International Journal of Sensor Networks
Proceedings of the 23rd ACM international conference on Great lakes symposium on VLSI
Using maximum coverage to optimize recommendation systems in e-commerce
Proceedings of the 7th ACM conference on Recommender systems
Tight approximation bounds for combinatorial frugal coverage algorithms
Journal of Combinatorial Optimization
Timing-driven variation-aware synthesis of hybrid mesh/tree clock distribution networks
Integration, the VLSI Journal
How to guard a graph against tree movements
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Greedy algorithms for on-line set-covering and related problems
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
How to guard a graph against tree moves
Information Processing Letters
Three-dimensional coverage planning for an underwater inspection robot
International Journal of Robotics Research
Lift-and-Project methods for set cover and knapsack
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
Computers and Operations Research
Lower and upper bounds for the Bin Packing Problem with Fragile Objects
Discrete Applied Mathematics
Identifying path covers in graphs
Journal of Discrete Algorithms
Survivable network activation problems
Theoretical Computer Science
On construction of quality fault-tolerant virtual backbone in wireless networks
IEEE/ACM Transactions on Networking (TON)
A probabilistic framework for jammer identification in MANETs
Ad Hoc Networks
Hi-index | 0.02 |
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 kanpsack 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 n^@e, where n is the problem size and @e0 depends on the algorithm.