Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on 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
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Approximating the minimum maximal independence number
Information Processing Letters
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the power of multi-prover interactive protocols
Theoretical Computer Science
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
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
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 algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Some optimal inapproximability results
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
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Zero Knowledge and the Chromatic Number
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Splitters and near-optimal derandomization
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Efficient recovery from power outage (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximating the domatic number
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Key management for restricted multicast using broadcast encryption
IEEE/ACM Transactions on Networking (TON)
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Some optimal inapproximability results
Journal of the ACM (JACM)
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - &egr;
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On propagation of deletions and annotations through views
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An approximation algorithm for the group Steiner problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A note on the minimum label spanning tree
Information Processing Letters
Steiner trees in uniformly quasi-bipartite graphs
Information Processing Letters
Integrality ratio for group Steiner trees and directed steiner trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Multi-embedding and path approximation of metric spaces
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A new approximation algorithm for the asymmetric TSP with triangle inequality
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Hardness of Set Cover with Intersection 1
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Clique Is Hard to Approximate within n1-o(1)
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Inapproximability Results for Equations over Finite Groups
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On the inapproximability of broadcasting time
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
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
Approximating Min-sum Set Cover
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Hardness of Approximation for Vertex-Connectivity Network-Design Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
The Non-approximability of Non-Boolean Predicates
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Towards Making Broadcast Encryption Practical
FC '99 Proceedings of the Third International Conference on Financial Cryptography
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode
ESA '01 Proceedings of the 9th 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
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Simple analysis of graph tests for linearity and PCP
Random Structures & Algorithms
Designing overlay multicast networks for streaming
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A new multilayered PCP and the hardness of hypergraph vertex cover
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
Towards optimal lower bounds for clique and chromatic number
Theoretical Computer Science
Beyond independent relevance: methods and evaluation metrics for subtopic retrieval
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
An exact algorithm for the maximum leaf spanning tree problem
Computers and Operations Research
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor
Information Processing Letters
Zero-Error Source Coding with Maximum Distortion Criterion
DCC '02 Proceedings of the Data Compression Conference
On good algorithms for determining unsatisfiability of propositional formulas
Discrete Applied Mathematics - The renesse issue on satisfiability
A new approach for approximating node deletion problems
Information Processing Letters
Hardness results and approximation algorithms of k-tuple domination in graphs
Information Processing Letters
On approximability of linear ordering and related NP-optimization problems on graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Structural and algorithmic aspects of massive social networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Facility location with Service Installation Costs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Inapproximability results for equations over finite groups
Theoretical Computer Science - Special issue on automata, languages and programming
Polynomial-time data reduction for dominating set
Journal of the ACM (JACM)
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Concurrent open shop scheduling to minimize the weighted number of tardy jobs
Journal of Scheduling
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A microeconomic data mining problem: customer-oriented catalog segmentation
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
On domain-partitioning induction criteria: worst-case bounds for the worst-case based
Theoretical Computer Science
On the hardness of the minimum height decision tree problem
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Is constraint satisfaction over two variables always easy?
Random Structures & Algorithms
A note on line broadcast in digraphs under the edge-disjoint paths mode
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Optimizing Multiple Seeds for Protein Homology Search
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Approximation algorithms for combinatorial auctions with complement-free bidders
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Every 2-CSP allows nontrivial approximation
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved approximation algorithms for geometric set cover
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Substructure similarity search in graph databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Guest column: inapproximability results via Long Code based PCPs
ACM SIGACT News
Partial covering of hypergraphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Absolute o(logm) error in approximating random set covering: an average case analysis
Information Processing Letters
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Admission control to minimize rejections and online set cover with repetitions
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Iterative Dutch combinatorial auctions
Annals of Mathematics and Artificial Intelligence
Minimizing interference in ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
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
Confronting hardness using a hybrid approach
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Combination can be hard: approximability of the unique coverage problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An improved approximation algorithm for combinatorial auctions with submodular bidders
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The labeled perfect matching in bipartite graphs
Information Processing Letters
A refined search tree technique for Dominating Set on planar graphs
Journal of Computer and System Sciences
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Journal of Computer and System Sciences
Cybernetics and Systems Analysis
On the complexity of approximating tsp with neighborhoods and related problems
Computational Complexity
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The minimum-entropy set cover problem
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Efficiently computing succinct trade-off curves
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
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)
Random Structures & Algorithms
Constant-time distributed dominating set approximation
Distributed Computing
Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree
Mobile Networks and Applications
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
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Feature-based similarity search in graph structures
ACM Transactions on Database Systems (TODS)
Exact algorithms and applications for Tree-like Weighted Set Cover
Journal of Discrete Algorithms
Theoretical Computer Science
Scheduling to minimize gaps and power consumption
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Balanced max 2-sat might not be the hardest
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Proceedings of the 8th ACM conference on Electronic commerce
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
Journal of the ACM (JACM)
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
Approximating the spanning star forest problem and its applications to genomic sequence alignment
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Logical analysis of data --- the vision of Peter L. Hammer
Annals of Mathematics and Artificial Intelligence
Comparing Genomes with Duplications: A Computational Complexity Point of View
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Limited verification of identities to induce false-name-proofness
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
On the production of anorexic plan diagrams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Information Processing Letters
Discrete Applied Mathematics
Approximating the online set multicover problems via randomized winnowing
Theoretical Computer Science
Streaming cache placement problems: complexity and algorithms
International Journal of Computational Science and Engineering
Counting the number of independent sets in chordal graphs
Journal of Discrete Algorithms
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
ACM Transactions on Algorithms (TALG)
A combinatorial allocation mechanism with penalties for banner advertising
Proceedings of the 17th international conference on World Wide Web
Nature Reserve Selection Problem: A Tight Approximation Algorithm
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Optimal approximation for the submodular welfare problem in the value oracle model
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hardness of optimal spaced seed design
Journal of Computer and System Sciences
Helly-type theorems for approximate covering
Proceedings of the twenty-fourth annual symposium on Computational geometry
A new approximation algorithm for the asymmetric TSP with triangle inequality
ACM Transactions on Algorithms (TALG)
On the complexity of minimizing interference in ad-hoc and sensor networks
Theoretical Computer Science
Efficient sensor network design for continuous monitoring of moving objects
Theoretical Computer Science
Location-unaware coverage in wireless sensor networks
Ad Hoc Networks
Set covering approach for reconstruction of sibling relationships
Optimization Methods & Software - Systems Analysis, Optimization and Data Mining in Biomedicine
Red-blue covering problems and the consecutive ones property
Journal of Discrete Algorithms
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Robust Combinatorial Optimization with Exponential Scenarios
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
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
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
Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Stabbing Convex Polygons with a Segment or a Polygon
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Approximation hardness of dominating set problems in bounded degree graphs
Information and Computation
Identifying robust plans through plan diagram reduction
Proceedings of the VLDB Endowment
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
Random Structures & Algorithms
Semi-preemptive routing on trees
Discrete Applied Mathematics
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
Journal of Network and Systems Management
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
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
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Journal of Computer and System Sciences
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
A Θ( logn)-approximation for the set cover problem with set ownership
Information Processing Letters
Maximizing submodular set functions subject to multiple linear constraints
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the approximability of Dodgson and Young elections
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Bicriteria approximation tradeoff for the node-cost budget problem
ACM Transactions on Algorithms (TALG)
Stochastic Submodular Maximization
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Bid optimization for broad match ad auctions
Proceedings of the 18th international conference on World wide web
Optimal monitoring in multi-channel multi-radio wireless mesh networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Efficient approximation of min set cover by moderately exponential algorithms
Theoretical Computer Science
Independent sets in bounded-degree hypergraphs
Discrete Applied Mathematics
On approximating four covering and packing problems
Journal of Computer and System Sciences
Computing the arrangement of circles on a sphere, with applications in structural biology
Computational Geometry: Theory and Applications
Recent Developments in Algorithmic Teaching
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Non-monotone submodular maximization under matroid and knapsack constraints
Proceedings of the forty-first annual ACM symposium on Theory of computing
Small-size ε-nets for axis-parallel rectangles and boxes
Proceedings of the forty-first annual ACM symposium on Theory of computing
Objective reduction in evolutionary multiobjective optimization: Theory and applications
Evolutionary Computation
Epsilon nets and union complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry
Near-linear approximation algorithms for geometric hitting sets
Proceedings of the twenty-fifth annual symposium on Computational geometry
On the set multi-cover problem in geometric settings
Proceedings of the twenty-fifth annual symposium on Computational geometry
Exponential-time approximation of weighted set cover
Information Processing Letters
On Approximating an Implicit Cover Problem in Biology
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On the complexity of the regenerator placement problem in optical networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Set multi-covering via inclusion-exclusion
Theoretical Computer Science
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
Minimum Entropy Combinatorial Optimization Problems
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
An Analysis of NP-Completeness in Novelty and Diversity Ranking
ICTIR '09 Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory
Incremental deployment of network monitors based on Group Betweenness Centrality
Information Processing Letters
Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximating Some Network Design Problems with Node Costs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Non-redundant Subgroup Discovery Using a Closure System
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Nonmyopic informative path planning in spatio-temporal models
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Multi-winner elections: complexity of manipulation, control, and winner-determination
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Hardness results and approximation algorithms for (weighted) paired-domination in graphs
Theoretical Computer Science
Computational study on planar dominating set problem
Theoretical Computer Science
A new local algorithm for backbone formation in ad hoc networks
Proceedings of the 6th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Admission control to minimize rejections and online set cover with repetitions
ACM Transactions on Algorithms (TALG)
Algorithms for ad hoc and sensor networks
Computer Communications
Journal of Discrete Algorithms
Approximation for minimum total dominating set
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Disjoint bases in a polymatroid
Random Structures & Algorithms
Approximate nonmyopic sensor selection via submodularity and partitioning
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
FRACTAL: efficient fault isolation using active testing
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Covering Games: Approximation through Non-cooperation
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On the hardness of the minimum height decision tree problem
Discrete Applied Mathematics
A greedy approximation algorithm for the group Steiner problem
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)
The labeled perfect matching in bipartite graphs
Information Processing Letters
Absolute o( logm) error in approximating random set covering: an average case analysis
Information Processing Letters
Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders
Mathematics of Operations Research
Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes
Mobile Networks and Applications
The hitting set problem and evolutionary algorithmic techniques with ad-hoc viruses (HEAT-V)
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Wavelength management in WDM rings to maximize the number of connections
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Distributed facility location algorithms for flexible configuration of wireless sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Recurrent predictive models for sequence segmentation
IDA'07 Proceedings of the 7th international conference on Intelligent data analysis
Location-unaware sensing range assignment in sensor networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Proceedings of the 19th international conference on World wide web
Paneling architectural freeform surfaces
ACM SIGGRAPH 2010 papers
On approximating minimum infrequent and maximum frequent sets
DS'07 Proceedings of the 10th international conference on Discovery science
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Mechanism design on trust networks
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Inapproximability results for equations over infinite groups
Theoretical Computer Science
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
Capacitated domination and covering: a parameterized perspective
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Exact algorithms for edge domination
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Online distributed sensor selection
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Approximating Steiner networks with node weights
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Domination in geometric intersection graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
P2P streaming capacity: survey and recent results
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Bisimulation-based approximate lifted inference
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Wireless sensor deployment for 3D coverage with constraints
INSS'09 Proceedings of the 6th international conference on Networked sensing systems
Computation and incentives in combinatorial public projects
Proceedings of the 11th ACM conference on Electronic commerce
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Set covering problems in role-based access control
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Block interaction: a generative summarization scheme for frequent patterns
Proceedings of the ACM SIGKDD Workshop on Useful Patterns
Localization: approximation and performance bounds to minimize travel distance
IEEE Transactions on Robotics
Combinatorial algorithms for fast clock mesh optimization
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
On computing compression trees for data collection in wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Brief announcement: pan and scan
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Partial information spreading with application to distributed maximum coverage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
An improved algorithm for the red-blue hitting set problem with the consecutive ones property
Information Processing Letters
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Multi-document summarization via budgeted maximization of submodular functions
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
On quality of monitoring for multi-channel wireless infrastructure networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Near optimal multi-application allocation in shared sensor networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
A generalized control-flow-aware pattern recognition algorithm for behavioral synthesis
Proceedings of the Conference on Design, Automation and Test in Europe
Expansion and search in networks
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Set cover algorithms for very large datasets
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Cost sharing and strategyproof mechanisms for set cover games
Journal of Combinatorial Optimization
New dominating sets in social networks
Journal of Global Optimization
Paired approximation problems and incompatible inapproximabilities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Energy efficient scheduling via partial shutdown
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
Primitives for active internet topology mapping: toward high-frequency characterization
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
SnipSuggest: context-aware autocompletion for SQL
Proceedings of the VLDB Endowment
Approximation algorithms for the capacitated domination problem
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Submodular secretary problem and extensions
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
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
Minimum dominating set approximation in graphs of bounded arboricity
DISC'10 Proceedings of the 24th international conference on Distributed computing
Algorithms for dominating set in disk graphs: breaking the log n Barrier
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Heuristic algorithms in computational molecular biology
Journal of Computer and System Sciences
Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms
Computers and Operations Research
Inferring social networks from outbreaks
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
On the approximability of robust spanning tree problems
Theoretical Computer Science
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Mathematics of Operations Research
Brief announcement: configuration of actuated camera networks for multi-target coverage
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
A practical robot coverage algorithm for unknown environments
MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I
A unified submodular framework for multimodal IC Trojan detection
IH'10 Proceedings of the 12th international conference on Information hiding
Information Processing Letters
An algorithmic treatment of strong queries
Proceedings of the fourth ACM international conference on Web search and data mining
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Approximation algorithm for the minimum directed tree cover
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
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
Teaching randomized learners with feedback
Information and Computation
Approximating covering problems by randomized search heuristics using multi-objective models*
Evolutionary Computation
Deterministic dominating set construction in networks with bounded degree
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Optimal sensor placement with signal propagation effects and inhomogeneous coverage preferences
International Journal of Sensor Networks
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
SIAM Journal on Computing
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
SIAM Journal on Computing
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
SIAM Journal on Computing
Approximating Steiner Networks with Node-Weights
SIAM Journal on Computing
Unique Games with Entangled Provers Are Easy
SIAM Journal on Computing
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
SIAM Journal on Discrete Mathematics
Multi-VPN optimization for scalable routing via relaying
IEEE/ACM Transactions on Networking (TON)
ROC: resilient online coverage for surveillance applications
IEEE/ACM Transactions on Networking (TON)
An analysis of NP-completeness in novelty and diversity ranking
Information Retrieval
Maximum betweenness centrality: approximability and tractable cases
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
multi-channel assignment for communication in radio networks
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Video distribution under multiple constraints
Theoretical Computer Science
On the complexity of privacy-preserving complex event processing
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Linear-work greedy parallel approximate set cover and variants
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Submodularity and its applications in optimized information gathering
ACM Transactions on Intelligent Systems and Technology (TIST)
A revealed preference approach to computational complexity in economics
Proceedings of the 12th ACM conference on Electronic commerce
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Proceedings of the forty-third annual ACM symposium on Theory of computing
Cybernetics and Systems Analysis
Approximating some network design problems with node costs
Theoretical Computer Science
Set covering with ordered replacement: additive and multiplicative gaps
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Approximation algorithms for single and multi-commodity connected facility location
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Benefits of bias: towards better characterization of network sampling
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Revisiting sequential pattern hiding to enhance utility
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Tight Approximation Algorithms for Maximum Separable Assignment Problems
Mathematics of Operations Research
Approximation algorithm for the uniform bounded facility problem
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
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
Complexity of total {k}-domination and related problems
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
Using SAT-based Craig interpolation to enlarge clock gating functions
Proceedings of the 48th Design Automation Conference
Domination when the stars are out
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Primal-dual approximation algorithms for node-weighted steiner forest on planar graphs
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
On capacitated set cover problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Theoretical Computer Science
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
On the complexity of searching in trees and partially ordered structures
Theoretical Computer Science
Center-based clustering under perturbation stability
Information Processing Letters
Minimum latency data aggregation in the physical interference model
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
A closest vector problem arising in radiation therapy planning
Journal of Combinatorial Optimization
Geometric rounding: a dependent randomized rounding scheme
Journal of Combinatorial Optimization
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
Maximizing Non-monotone Submodular Functions
SIAM Journal on Computing
Efficient in-network evaluation of multiple queries
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Adversarial Geospatial Abduction Problems
ACM Transactions on Intelligent Systems and Technology (TIST)
Inapproximability of the multi-level uncapacitated facility location problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximating rooted Steiner networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the existence of truthful mechanisms for the minimum-cost approximate shortest-paths tree problem
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
The node-weighted steiner problem in graphs of restricted node weights
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Minimum membership set covering and the consecutive ones property
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Non-metric multicommodity and multilevel facility location
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
COLT'06 Proceedings of the 19th annual conference on Learning Theory
The generalized deadlock resolution problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A better-than-greedy algorithm for k-set multicover
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Designing a truthful mechanism for a spanning arborescence bicriteria problem
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Complexity of majority monopoly and signed domination problems
Journal of Discrete Algorithms
Interference in cellular networks: the minimum membership set cover problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The reverse greedy algorithm for the metric K-median problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Inapproximability results for combinatorial auctions with submodular utility functions
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Fast Approximate Energy Minimization with Label Costs
International Journal of Computer Vision
International Journal of Sensor Networks
On complexity and approximability of the labeled maximum/perfect matching problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On two-stage stochastic minimum spanning trees
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
The complexity of making unique choices: approximating 1-in-k SAT
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Approximation algorithms for requirement cut on graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
The pipelined set cover problem
ICDT'05 Proceedings of the 10th international conference on Database Theory
A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Generalized machine activation problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The local lemma is tight for SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Ranking with submodular valuations
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Submodular maximization by simulated annealing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved bound for the union of fat triangles
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Hardness of optimal spaced seed design
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
The set cover with pairs problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Cost sharing and strategyproof mechanisms for set cover games
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Steiner tree reoptimization in graphs with sharpened triangle inequality
Journal of Discrete 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
On the approximation ability of evolutionary optimization with application to minimum set cover
Artificial Intelligence
Dense subgraphs with restrictions and applications to gene annotation graphs
RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
Improved algorithms and complexity results for power domination in graphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Minimizing the diameter of a network using shortcut edges
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Range augmentation problems in static ad-hoc wireless networks
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Wireless networking: graph theory unplugged
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
The complexity of minimum convex coloring
Discrete Applied Mathematics
EDGE DOMINATING SET: efficient enumeration-based exact algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
A (4+ε)-approximation for the minimum-weight dominating set problem in unit disk graphs
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Tight results on minimum entropy set cover
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
Covering analysis of the greedy algorithm for partial cover
Algorithms and Applications
The class cover problem with boxes
Computational Geometry: Theory and Applications
Approximation algorithms for a geometric set cover problem
Discrete Applied Mathematics
On the complexity of minimizing interference in ad-hoc and sensor networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Coping with interference: from maximum coverage to planning cellular networks
WAOA'06 Proceedings of the 4th international conference on 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
The covert set-cover problem with application to network discovery
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Variants of spreading messages
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Bounding the number of tolerable faults in majority-based systems
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
The steiner tree reoptimization problem with sharpened triangle inequality
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Algorithmic aspects of dominator colorings in graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
The 1-neighbour knapsack problem
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Optimal shortening of covering arrays
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Stochastic covering and adaptivity
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A 4-approximation algorithm for guarding 1.5-dimensional terrains
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Minimum cost source location problems with flow requirements
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Evader interdiction and collateral damage
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Optimizing budget allocation among channels and influencers
Proceedings of the 21st international conference on World Wide Web
Packing-based approximation algorithm for the k-set cover problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Approximation algorithm for security games with costly resources
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Algorithms for the minimum weight k-fold (connected) dominating set problem
Journal of Combinatorial Optimization
Adaptive submodularity: theory and applications in active learning and stochastic optimization
Journal of Artificial Intelligence Research
SCARAB: scaling reachability computation on large graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
A highway-centric labeling approach for answering distance queries on large sparse graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
From query complexity to computational complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the approximability of Dodgson and Young elections
Artificial Intelligence
Optimization with demand oracles
Proceedings of the 13th ACM Conference on Electronic Commerce
Learning on a budget: posted price mechanisms for online procurement
Proceedings of the 13th ACM Conference on Electronic Commerce
The computational complexity of truthfulness in combinatorial auctions
Proceedings of the 13th ACM Conference on Electronic Commerce
Approximating low-dimensional coverage problems
Proceedings of the twenty-eighth annual symposium on Computational geometry
Discrete Applied Mathematics
GMPLS label space minimization through hypergraph layouts
Theoretical Computer Science
Randomized sensing in adversarial environments
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Rounding to an integral program
Operations Research Letters
Improved approximation of maximum vertex cover
Operations Research Letters
Survey: A survey on the structure of approximation classes
Computer Science Review
Approximation of the Quadratic Set Covering problem
Discrete Optimization
Operations Research Letters
Combinatorial approximation algorithms: a comparative review
Operations Research Letters
A note on maximizing a submodular set function subject to a knapsack constraint
Operations Research Letters
Cheap, easy, and massively effective viral marketing in social networks: truth or fiction?
Proceedings of the 23rd ACM conference on Hypertext and social media
Parallel and I/O efficient set covering algorithms
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Rationalization of Triangle-Based Point-Folding Structures
Computer Graphics Forum
NP-completeness and APX-completeness of restrained domination in graphs
Theoretical Computer Science
Minimizing Energies with Hierarchical Costs
International Journal of Computer Vision
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
SIAM Journal on Computing
Campaigns for lazy voters: truncated ballots
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Efficient multi-way theta-join processing using MapReduce
Proceedings of the VLDB Endowment
Efficient submodular function maximization under linear packing constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Algorithmic aspects of k-tuple total domination in graphs
Information Processing Letters
The knapsack problem with neighbour constraints
Journal of Discrete Algorithms
Selective graph coloring in some special classes of graphs
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Complexity of distance paired-domination problem in graphs
Theoretical Computer Science
Privacy-aware personalization for mobile advertising
Proceedings of the 2012 ACM conference on Computer and communications security
Min-energy broadcast in mobile ad hoc networks with restricted motion
Journal of Combinatorial Optimization
Minimum latency data aggregation in the physical interference model
Computer Communications
Maximizing Conjunctive Views in Deletion Propagation
ACM Transactions on Database Systems (TODS)
On the set multicover problem in geometric settings
ACM Transactions on Algorithms (TALG)
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
Dynamic programming approach to optimization of approximate decision rules
Information Sciences: an International Journal
Fast vertex guarding for polygons with and without holes
Computational Geometry: Theory and Applications
Fast fusion moves for multi-model estimation
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
Weighted geometric set multi-cover via quasi-uniform sampling
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs
Information and Computation
Multi-rooted greedy approximation of directed steiner trees with applications
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Document selection for tiered indexing in commerce search
Proceedings of the sixth ACM international conference on Web search and data mining
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
Approximation Algorithms for Capacitated Location Routing
Transportation Science
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
Clustering under approximation stability
Journal of the ACM (JACM)
Scheduling to minimize gaps and power consumption
Journal of Scheduling
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems
ACM Transactions on Computational Logic (TOCL)
Maximal cliques based rigid body motion segmentation with a RGB-D camera
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part II
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Inequalities on submodular functions via term rewriting
Information Processing Letters
Fast greedy algorithms in mapreduce and streaming
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Diversity maximization under matroid constraints
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
A note on the hardness of sparse approximation
Information Processing Letters
Submodular secretary problem and extensions
ACM Transactions on Algorithms (TALG)
Using maximum coverage to optimize recommendation systems in e-commerce
Proceedings of the 7th ACM conference on Recommender systems
Topic diversity in tag recommendation
Proceedings of the 7th ACM conference on Recommender systems
Approximation algorithm for uniform bounded facility location problem
Journal of Combinatorial Optimization
Tight approximation bounds for combinatorial frugal coverage algorithms
Journal of Combinatorial Optimization
Approximating the reliable resource allocation problem using inverse dual fitting
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
Duty-cycle-aware minimum-energy multicasting in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Algorithms for hub label optimization
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Lift-and-Project methods for set cover and knapsack
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Optimal approximability of bookmark assignments
Discrete Applied Mathematics
An analytical model of a hybrid network of static and mobile sensors
Proceedings of the 9th Asian Internet Engineering Conference
Piggybacking on social networks
Proceedings of the VLDB Endowment
Efficient Approximation Algorithm for Data Retrieval with Conflicts in Wireless Networks
Proceedings of International Conference on Advances in Mobile Computing & Multimedia
Computing cooperative solution concepts in coalitional skill games
Artificial Intelligence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
On the k-edge-incident subgraph problem and its variants
Discrete Applied Mathematics
Proceedings of the International Conference on Computer-Aided Design
Eagle-eye: a near-optimal statistical framework for noise sensor placement
Proceedings of the International Conference on Computer-Aided Design
A note on the Clustered Set Covering Problem
Discrete Applied Mathematics
Efficient Two Dimensional-IP routing: An incremental deployment design
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the connectivity preserving minimum cut problem
Journal of Computer and System Sciences
The subdivision-constrained routing requests problem
Journal of Combinatorial Optimization
On the approximability of positive influence dominating set in social networks
Journal of Combinatorial Optimization
Guest column: the elusive inapproximability of the TSP
ACM SIGACT News
Dominating problems in swapped networks
Information Sciences: an International Journal
| Hi-index | 0.03 |
Given a collection F of subsets of S ={1,…,n}, setcover is the problem of selecting as few as possiblesubsets from F such that their union coversS,, and maxk-cover is the problem of selectingk subsets from F such that their union has maximum cardinality. Both these problems areNP-hard. We prove that (1 - o(1)) lnn is a threshold below which setcover cannot be approximated efficiently, unless NP has slightlysuperpolynomial time algorithms. This closes the gap (up to low-orderterms) between the ratio of approximation achievable by the greedyalogorithm (which is (1 - o(1)) lnn), and provious results of Lund and Yanakakis, that showed hardness ofapproximation within a ratio of log2n/2≃0.72 ln n. For maxk-cover, we show an approximationthreshold of (1 - 1/e)(up tolow-order terms), under assumption that P≠NP.