Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
SIAM Journal on Discrete Mathematics
A modified greedy heuristic for the set covering problem with improved worst case bound
Information Processing Letters
Approximation results for the minimum graph coloring problem
Information Processing Letters
Maximizing the number of unused colors in the vertex coloring problem
Information Processing Letters
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
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximating maximum independent set in bounded degree graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximating k-Set Cover and Complementary Graph Coloring
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Clustering algorithms for wireless ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
On point covers of c-oriented polygons
Theoretical Computer Science
Combinatorial optimization algorithms for radio network planning
Theoretical Computer Science
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for Partial Covering Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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
Approximation algorithms for partial covering problems
Journal of Algorithms
Approximation algorithms for some vehicle routing problems
Discrete Applied Mathematics
Summarizing level-two topological relations in large spatial datasets
ACM Transactions on Database Systems (TODS)
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)
Exact algorithms and applications for Tree-like Weighted Set Cover
Journal of Discrete Algorithms
Multiscale histograms: summarizing topological relations in large spatial datasets
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A better differential approximation ratio for symmetric TSP
Theoretical Computer Science
Efficient sensor network design for continuous monitoring of moving objects
Theoretical Computer Science
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Parameterized Algorithms for Generalized Domination
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Approximation hardness of dominating set problems in bounded degree graphs
Information and Computation
Note: Approximation of the k-batch consolidation problem
Theoretical Computer Science
New differential approximation algorithm for k-customer vehicle routing problem
Information Processing Letters
Scheduling with conflicts: online and offline algorithms
Journal of Scheduling
Efficient approximation of min set cover by moderately exponential algorithms
Theoretical Computer Science
On the Approximability of Some Haplotyping Problems
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Covering the edges of bipartite graphs using K2,2 graphs
Theoretical Computer Science
Approximation for minimum total dominating set
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Approximation algorithms for some vehicle routing problems
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)
Efficient sensor network design for continuous monitoring of moving objects
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Covering the edges of bipartite graphs using K2,2gaphs
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Capacitated domination and covering: a parameterized perspective
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Optimizing restriction site placement for synthetic genomes
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
Information Processing Letters
An improved approximation algorithm for spanning star forest in dense graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Uniform unweighted set cover: The power of non-oblivious local search
Theoretical Computer Science
On variants of the spanning star forest problem
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
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
A better-than-greedy algorithm for k-set multicover
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Oriented coloring: complexity and approximation
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
On the approximation ability of evolutionary optimization with application to minimum set cover
Artificial Intelligence
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Optimizing restriction site placement for synthetic genomes
Information and Computation
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
Approximating the unweighted k-set cover problem: greedy meets local search
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Packing-based approximation algorithm for the k-set cover problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Survey: A survey on the structure of approximation classes
Computer Science Review
Approximation of the Quadratic Set Covering problem
Discrete Optimization
The maximum saving partition problem
Operations Research Letters
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
Placing regenerators in optical networks to satisfy multiple sets of requests
IEEE/ACM Transactions on Networking (TON)
A 6/5-approximation algorithm for the maximum 3-cover problem
Journal of Combinatorial Optimization
A randomised approximation algorithm for the partial vertex cover problem in hypergraphs
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
On the approximability and exact algorithms for vector domination and related problems in graphs
Discrete Applied Mathematics
Improved approximation for spanning star forest in dense graphs
Journal of Combinatorial Optimization
Tight approximation bounds for combinatorial frugal coverage algorithms
Journal of Combinatorial Optimization
Boolean functions with long prime implicants
Information Processing Letters
An improved approximation ratio for the jump number problem on interval orders
Theoretical Computer Science
| Hi-index | 0.01 |