Cooperative facility location games
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A new heuristic for rectilinear Steiner trees
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Approximately covering by cycles in planar graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Applications of approximation algorithms to cooperative games
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Equitable cost allocations via primal-dual-type algorithms
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
Winner determination in combinatorial auction generalizations
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
A survey of graph layout problems
ACM Computing Surveys (CSUR)
The importance of the P versus NP question
Journal of the ACM (JACM)
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
A primal-dual schema based approximation algorithm for the element connectivity problem
Journal of Algorithms
A combinatorial algorithm for computing a maximum independent set in a t-perfect graph
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
Primal-dual schema based approximation algorithms
Theoretical aspects of computer science
Optimized Substructure Discovery for Semi-structured Data
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Different Local Search Algorithms in STAGE for Solving Bin Packing Problem
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Parallel Distance-k Coloring Algorithms for Numerical Optimization
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Hardness of Approximation for Vertex-Connectivity Network-Design Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On the Hardness of Approximating Minimum Monopoly Problems
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting
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
Primal-Dual Schema Based Approximation Algorithms
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Clustering Data Streams: Theory and Practice
IEEE Transactions on Knowledge and Data Engineering
Energy-efficient caching strategies in ad hoc wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
On the core of the multicommodity flow game
Proceedings of the 4th ACM conference on Electronic commerce
Strategyproof cost-sharing mechanisms for set cover and facility location games
Proceedings of the 4th ACM conference on Electronic commerce
Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A lower bound for the hitting set size for combinatorial rectangles and an application
Information Processing Letters
Efficient location area planning for personal communication systems
Proceedings of the 9th annual international conference on Mobile computing and networking
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
Approximability results for stable marriage problems with ties
Theoretical Computer Science
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
An efficient R-tree implementation over flash-memory storage systems
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Profit-driven uniprocessor scheduling with energy and timing constraints
Proceedings of the 2004 ACM symposium on Applied computing
Probabilistic wavelet synopses
ACM Transactions on Database Systems (TODS)
Approximation schemes for multidimensional packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate distance oracles for unweighted graphs in Õ (n2) time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity facility location
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Models of greedy algorithms for graph problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A general approach to online network optimization problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate classification via earthmover metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Cooperative facility location games
Journal of Algorithms - Special issue: SODA 2000
A genetic algorithm approach for regrouping service sites
Computers and Operations Research
On approximately fair allocations of indivisible goods
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Toward an automated verification of certificates of authenticity
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
A scalable approach for reliable downstream data delivery in wireless sensor networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Asymmetric k-center is log* n-hard to approximate
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Estimating the weight of metric minimum spanning trees in sublinear-time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Energy-efficient flash-memory storage systems with an interrupt-emulation mechanism
Proceedings of the 2nd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Fairness and load balancing in wireless LANs using association control
Proceedings of the 10th annual international conference on Mobile computing and networking
On achieving software diversity for improved network security using distributed coloring algorithms
Proceedings of the 11th ACM conference on Computer and communications security
Efficient location area planning for cellular networks with hierarchical location databases
Computer Networks: The International Journal of Computer and Telecommunications Networking
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Cross-monotonic cost sharing methods for connected facility location games
Theoretical Computer Science
Distributed approximation: a survey
ACM SIGACT News
Performance analysis of a greedy algorithm for inferring boolean functions
Information Processing Letters
Approximation algorithms for network design with metric costs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Partitioning of Web graphs by community topology
WWW '05 Proceedings of the 14th international conference on World Wide Web
A Hard Dial-a-Ride Problem that is Easy on Average
Journal of Scheduling
On the core of the multicommodity flow game
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Strategyproof cost-sharing mechanisms for set cover and facility location games
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Approximation algorithm for weighted weak vertex cover
Journal of Computer Science and Technology
Mechanism design for software agents with complete information
Decision Support Systems - Special issue: Decision theory and game theory in agent design
Guest column: inapproximability results via Long Code based PCPs
ACM SIGACT News
Computing in Science and Engineering
On distance scales, embeddings, and efficient relaxations of the cut cone
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the smallest k-edge connected spanning subgraph by LP-rounding
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Partial covering of hypergraphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Quorum placement in networks to minimize access delays
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Asymmetric k-center is log* n-hard to approximate
Journal of the ACM (JACM)
QoS-Aware Replica Placement for Content Distribution
IEEE Transactions on Parallel and Distributed Systems
Weighted coloring based channel assignment for WLANs
ACM SIGMOBILE Mobile Computing and Communications Review
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A general approach for incremental approximation and hierarchical clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient algorithms for online decision problems
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Approximation algorithms for covering/packing integer programs
Journal of Computer and System Sciences
Near-optimal sensor placements: maximizing information while minimizing communication cost
Proceedings of the 5th international conference on Information processing in sensor networks
Multiprocessor synthesis for periodic hard real-time tasks under a given energy constraint
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Gowers uniformity, influence of variables, and PCPs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximation and streaming algorithms for histogram construction problems
ACM Transactions on Database Systems (TODS)
Message ferry route design for sparse ad hoc networks with mobile nodes
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Procrastination for leakage-aware rate-monotonic scheduling on a dynamic voltage scaling processor
Proceedings of the 2006 ACM SIGPLAN/SIGBED conference on Language, compilers, and tool support for embedded systems
APX-hardness of domination problems in circle graphs
Information Processing Letters
Minimum Cost Wireless Broadband Overlay Network Planning
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Subset-conjunctive rules for breast cancer diagnosis
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
Approximation schemes for knapsack problems with shelf divisions
Theoretical Computer Science
System level design paradigms: Platform-based design and communication synthesis
Proceedings of the 41st annual Design Automation Conference
On certain connectivity properties of the internet topology
Journal of Computer and System Sciences - Special issue on FOCS 2003
Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree
Mobile Networks and Applications
Deformable spanners and applications
Computational Geometry: Theory and Applications
On the capacity of information networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Matrix games in the multicast networks: maximum information flows with network switching
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On the capacity of multiple unicast sessions in undirected graphs
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Energy-efficient broadcasting in all-wireless networks
Wireless Networks
Correlation clustering in general weighted graphs
Theoretical Computer Science - Approximation and online algorithms
Asymmetry in k-center variants
Theoretical Computer Science - Approximation and online algorithms
Journal of Experimental Algorithmics (JEA)
Algorithmic aspects of bandwidth trading
ACM Transactions on Algorithms (TALG)
An efficient mechanism for auctioning alternative paths
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
Cell Breathing in Wireless LANs: Algorithms and Evaluation
IEEE Transactions on Mobile Computing
On a bidirected relaxation for the MULTIWAY CUT problem
Discrete Applied Mathematics - Special issue: Max-algebra
Designing small keyboards is hard
Theoretical Computer Science
A general approach to online network optimization problems
ACM Transactions on Algorithms (TALG)
Rectangle covers revisited computationally
Journal of Experimental Algorithmics (JEA)
Energetic performance of service-oriented multi-radio networks: issues and perspectives
WOSP '07 Proceedings of the 6th international workshop on Software and performance
Efficient location area planning for personal communication systems
IEEE/ACM Transactions on Networking (TON)
Efficient cache placement in multi-hop wireless networks
IEEE/ACM Transactions on Networking (TON)
A heuristic for the Stacker Crane Problem on trees which is almost surely exact
Journal of Algorithms
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
Discrete Applied Mathematics
New primal-dual algorithms for Steiner tree problems
Computers and Operations Research
A primal-dual algorithm for online non-uniform facility location
Journal of Discrete Algorithms
Approximately dominating representatives
Theoretical Computer Science
Computer Networks: The International Journal of Computer and Telecommunications Networking
Allocation cost minimization for periodic hard real-time tasks in energy-constrained DVS systems
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Combinatorial algorithms for fast clock mesh optimization
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
Theoretical Computer Science
Coverage breach problems in bandwidth-constrained sensor networks
ACM Transactions on Sensor Networks (TOSN)
Cut problems in graphs with a budget constraint
Journal of Discrete Algorithms
Extended wavelets for multiple measures
ACM Transactions on Database Systems (TODS)
A unified platform for data driven web applications with automatic client-server partitioning
Proceedings of the 16th international conference on World Wide Web
The discoverability of the web
Proceedings of the 16th international conference on World Wide Web
Smoothed analysis of binary search trees
Theoretical Computer Science
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
An approximation algorithm for max-min fair allocation of indivisible goods
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Limitations of VCG-based mechanisms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Some new results on node-capacitated packing of A-paths
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Survivable network design with degree or order constraints
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximating minimum bounded degree spanning trees to within one of optimal
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Proceedings of the 8th ACM conference on Electronic commerce
Optimization of continuous queries with shared expensive filters
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximate Labeling via Graph Cuts Based on Linear Programming
IEEE Transactions on Pattern Analysis and Machine Intelligence
Performance Analysis of Adaptive Admission Control Algorithms for Bandwidth Brokers
Journal of Network and Systems Management
An efficient B-tree layer implementation for flash-memory storage systems
ACM Transactions on Embedded Computing Systems (TECS)
Approximating covering problems by randomized search heuristics using multi-objective models
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Efficient approximation of convex recolorings
Journal of Computer and System Sciences
Compacting cuts: a new linear formulation for minimum cut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for node-weighted buy-at-bulk network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
ISLPED '07 Proceedings of the 2007 international symposium on Low power electronics and design
Cross-layer latency minimization in wireless networks with SINR constraints
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
A projection based multiscale optimization method for eigenvalue problems
Journal of Global Optimization
Approximation algorithms for maximum cut with limited unbalance
Theoretical Computer Science
Approximability of the capacitated b-edge dominating set problem
Theoretical Computer Science
Fairness and load balancing in wireless LANs using association control
IEEE/ACM Transactions on Networking (TON)
Tracking Uncertainty with Probabilistic Logic Circuit Testing
IEEE Design & Test
Integrated placement and skew optimization for rotary clocking
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Primitives for workload summarization and implications for SQL
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Test suite reduction and prioritization with call trees
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Competitiveness via primal-dual
ACM SIGACT News
Approximation algorithm for the temperature-aware scheduling problem
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
A rounding algorithm for approximating minimum Manhattan networks
Theoretical Computer Science
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Information Processing Letters
Crawl ordering by search impact
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
A Framework for Identifying Compromised Nodes in Wireless Sensor Networks
ACM Transactions on Information and System Security (TISSEC)
Minimum DVS gateway deployment in DVS-based overlay streaming
Computer Communications
Graph balancing: a special case of scheduling unrelated parallel machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Set connectivity problems in undirected graphs and the directed Steiner network problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fully polynomial time approximation schemes for stochastic dynamic programs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Designing networks with good equilibria
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of influence in social networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A fast asymptotic approximation scheme for bin packing with rejection
Theoretical Computer Science
Approximating the online set multicover problems via randomized winnowing
Theoretical Computer Science
A one-dimensional bin packing problem with shelf divisions
Discrete Applied Mathematics
Highly scalable algorithms for robust string barcoding
International Journal of Bioinformatics Research and Applications
Temperature-aware MPSoC scheduling for reducing hot spots and gradients
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Conditional functional dependencies for capturing data inconsistencies
ACM Transactions on Database Systems (TODS)
Externalities in online advertising
Proceedings of the 17th international conference on World Wide Web
Sensor Selection for Minimizing Worst-Case Prediction Error
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Additive approximation for bounded degree survivable network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Complexity in wireless scheduling: impact and tradeoffs
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Simultaneous matchings: Hardness and approximation
Journal of Computer and System Sciences
Near-optimal algorithms for shared filter evaluation in data stream systems
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A generic flow algorithm for shared filter ordering problems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximation algorithms for co-clustering
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
An efficient architecture for bandwidth Brokers in DiffServ networks
International Journal of Network Management
A new approximation algorithm for the asymmetric TSP with triangle inequality
ACM Transactions on Algorithms (TALG)
Fault-tolerant facility location
ACM Transactions on Algorithms (TALG)
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
Theoretical Computer Science
A note on systems with max--min and max-product constraints
Fuzzy Sets and Systems
Red-blue covering problems and the consecutive ones property
Journal of Discrete Algorithms
Efficient distributed approximation algorithms via probabilistic tree embeddings
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Exact and approximate link scheduling algorithms under the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Computer Vision and Image Understanding
Computer Vision and Image Understanding
Linear Transformations in Boolean Complexity Theory
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Approximating Generalized Multicut on Trees
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Optimal Efficiency Guarantees for Network Design Mechanisms
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
On the Minimum Hitting Set of Bundles Problem
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Approximating Independent Set and Coloring in Random Uniform Hypergraphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Stabbing Convex Polygons with a Segment or a Polygon
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
Conditioning probabilistic databases
Proceedings of the VLDB Endowment
The problem of placing mobility anchor points in wireless mesh networks
Proceedings of the 6th ACM international symposium on Mobility management and wireless access
An energy-efficient I/O request mechanism for multi-bank flash-memory storage systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Student-Project Allocation with preferences over Projects
Journal of Discrete Algorithms
Note: The complexity of a minimum reload cost diameter problem
Discrete Applied Mathematics
Packing and Covering δ-Hyperbolic Spaces by Balls
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
Efficient multicasting over large-scale WLANs through controlled association
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximation algorithms for restless bandit problems
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the maximum quadratic assignment problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A logarithmic approximation for unsplittable flow on line graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating fractional hypertree width
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
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
The power of verification for one-parameter agents
Journal of Computer and System Sciences
A 5+epsilon (Porson)-approximation algorithm for minimum weighted dominating set in unit disk graph
Theoretical Computer Science
Fast payment schemes for truthful mechanisms with verification
Theoretical Computer Science
Analyses of simple hybrid algorithms for the vertex cover problem*
Evolutionary Computation
Approximation algorithms for the weighted independent set problem in sparse graphs
Discrete Applied Mathematics
Approximation algorithm for maximum edge coloring
Theoretical Computer Science
An approximation algorithm to the k-Steiner Forest problem
Theoretical Computer Science
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
IEEE/ACM Transactions on Networking (TON)
On approximating optimum repairs for functional dependency violations
Proceedings of the 12th International Conference on Database Theory
Static and dynamic temperature-aware scheduling for multiprocessor SoCs
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Measuring the effectiveness of the s-metric to produce better network models
Proceedings of the 40th Conference on Winter Simulation
Quicklink selection for navigational query results
Proceedings of the 18th international conference on World wide web
On approximating four covering and packing problems
Journal of Computer and System Sciences
Clustering with Lower Bound on Similarity
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Compacting cuts: A new linear formulation for minimum cut
ACM Transactions on Algorithms (TALG)
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
Clustering with r-regular graphs
Pattern Recognition
Polyhedral outer approximations with application to natural language parsing
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Finding a team of experts in social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
A framework for testing query transformation rules
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Exponential-time approximation of weighted set cover
Information Processing Letters
Cheap or Flexible Sensor Coverage
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
On Approximating an Implicit Cover Problem in Biology
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Algorithms for Placing Monitors in a Flow Network
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Improved Bounds for Facility Location Games with Fair Cost Allocation
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Real-Time Algorithm Scheme for n-Vehicle Exploration Problem
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Near optimal battery-aware energy management
Proceedings of the 14th ACM/IEEE international symposium on Low power electronics and design
Set multi-covering via inclusion-exclusion
Theoretical Computer Science
FPGA placement using space-filling curves: Theory meets practice
ACM Transactions on Embedded Computing Systems (TECS)
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level
Mathematics of Operations Research
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Journal of Signal Processing Systems
Genotype Tagging with Limited Overfitting
BSB '09 Proceedings of the 4th Brazilian Symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology
On the value of good advice: the complexity of A* search with accurate heuristics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Information-theoretic approaches to branching in search
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
On the minimum hitting set of bundles problem
Theoretical Computer Science
Minimization of the reconfiguration latency for the mapping of applications on FPGA-based systems
CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Topology selection for stream mining systems
LS-MMRM '09 Proceedings of the First ACM workshop on Large-scale multimedia retrieval and mining
Selectively retrofitting monitoring in distributed systems
ACM SIGMETRICS Performance Evaluation Review
Priority algorithms for graph optimization problems
Theoretical Computer Science
Deformable spanners and applications
Computational Geometry: Theory and Applications
Video-aware opportunistic network coding over wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
On the Maximum Quadratic Assignment Problem
Mathematics of Operations Research
A simple non-interactive pairwise key establishment scheme in sensor networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Exact cardinality query optimization for optimizer testing
Proceedings of the VLDB Endowment
On achieving group strategyproof information dissemination in wireless networks
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Local Algorithms: Self-stabilization on Speed
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Exact Algorithms for Set Multicover and Multiset Multicover Problems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Route-Enabling Graph Orientation Problems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
The Fault-Tolerant Facility Allocation Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On Stackelberg Pricing with Computationally Bounded Consumers
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Covering Games: Approximation through Non-cooperation
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On the core of the multicommodity flow game
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Strategyproof cost-sharing mechanisms for set cover and facility location games
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
An approximation algorithm for a 2-depot, heterogeneous vehicle routing problem
ACC'09 Proceedings of the 2009 conference on American Control Conference
On a bidirected relaxation for the MULTIWAY CUT problem
Discrete Applied Mathematics
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
Subset-conjunctive rules for breast cancer diagnosis
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Performance analysis of a greedy algorithm for inferring Boolean functions
Information Processing Letters
Approximating fractional hypertree width
ACM Transactions on Algorithms (TALG)
Facility location with hierarchical facility costs
ACM Transactions on Algorithms (TALG)
Knowledge Based Image Annotation Refinement
Journal of Signal Processing Systems
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
Mathematics of Operations Research
Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes
Mobile Networks and Applications
Note: Approximation algorithms for art gallery problems in polygons
Discrete Applied Mathematics
A fair optimization scheduling scheme for IEEE 802.16 networks in multimedia applications
Journal of Visual Communication and Image Representation
Scalable diagnosis in IP networks using path-based measurement and inference: A learning framework
Journal of Visual Communication and Image Representation
Non-cooperative facility location and covering games
Theoretical Computer Science
Approximation algorithms for the Bipartite Multicut problem
Information Processing Letters
SSDE: fast graph drawing using sampled spectral distance embedding
GD'06 Proceedings of the 14th international conference on Graph drawing
An improved approximation algorithm for vertex cover with hard capacities
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Algorithmic aspects of bandwidth trading
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Real-time scheduling with a budget
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
New algorithms for SIMD alignment
CC'07 Proceedings of the 16th international conference on Compiler construction
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences
Approximation algorithms for 3D orthogonal Knapsack
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Approximation algorithms for maximum edge coloring problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Optimal edge deletions for signed graph balancing
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Hybrid topology for multicast support in constrained WDM networks
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Pursuit-evasion on trees by robot teams
IEEE Transactions on Robotics
Steiner forests on stochastic metric graphs
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Dynamic programming based algorithms for set multicover and multiset multicover problems
Theoretical Computer Science
Pricing commodities, or how to sell when buyers have restricted valuations
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Coalition structure generation utilizing compact characteristic function representations
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers
INFORMS Journal on Computing
Comparing and aggregating partially resolved trees
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Competitive cost sharing with economies of scale
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
PinKDD'07 Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD
Bisimulation-based approximate lifted inference
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Synthesizing view definitions from data
Proceedings of the 13th International Conference on Database Theory
The maximum multiflow problems with bounded fractionality
Proceedings of the forty-second ACM symposium on Theory of computing
Matroid matching: the power of local search
Proceedings of the forty-second ACM symposium on Theory of computing
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
Weighted geometric set cover via quasi-uniform sampling
Proceedings of the forty-second ACM symposium on Theory of computing
Privacy-aware location data publishing
ACM Transactions on Database Systems (TODS)
On probabilistic fixpoint and Markov chain query languages
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Hermes: clustering users in large-scale e-mail services
Proceedings of the 1st ACM symposium on Cloud computing
Optimizing content freshness of relations extracted from the web using keyword search
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Efficient traffic loss evaluation for transport backbone networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A local 2-approximation algorithm for the vertex cover problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
A generic algorithm for approximately solving stochastic graph optimization problems
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
On the hardness of approximating stopping and trapping sets
IEEE Transactions on Information Theory
There is no EPTAS for two-dimensional knapsack
Information Processing Letters
Combinatorial algorithms for fast clock mesh optimization
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Ant colony optimization and the minimum cut problem
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Cross-layer optimization for wireless networks with deterministic channel models
INFOCOM'10 Proceedings of the 29th conference on Information communications
INFOCOM'10 Proceedings of the 29th conference on Information communications
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
A polylogarithmic approximation for computing non-metric terminal Steiner trees
Information Processing Letters
Complexity of social welfare optimization in multiagent resource allocation
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Discrete Applied Mathematics
A hyper-graph approach for analyzing transcriptional networks in breast cancer
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
Optimizing cost and performance in online service provider networks
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
IEEE Transactions on Information Theory
Noninteractive pairwise key establishment for sensor networks
IEEE Transactions on Information Forensics and Security
Breaking out of the box of recommendations: from items to packages
Proceedings of the fourth ACM conference on Recommender systems
Analytical and experimental comparison of six algorithms for the vertex cover problem
Journal of Experimental Algorithmics (JEA)
Note: Combinatorial model and bounds for target set selection
Theoretical Computer Science
Power in unity: forming teams in large-scale community systems
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Choosing your own adventure: automatic taxonomy generation to permit many paths
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
An improved competitive algorithm for reordering buffer management
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
EDF-schedulability of synchronous periodic task systems is coNP-hard
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Testing additive integrality gaps
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Multiple genome alignment based on longest path in directed acyclic graphs
International Journal of Bioinformatics Research and Applications
Some results on incremental vertex cover problem
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Efficient exact and approximate algorithms for the complement of maximal strip recovery
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Placing regenerators in optical networks to satisfy multiple sets of requests
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Theory of communication networks
Algorithms and theory of computation handbook
Approximation algorithms for NP-hard optimization problems
Algorithms and theory of computation handbook
Exploiting conflict structures in inconsistent databases
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Using learnt clauses in MAXSAT
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Approximating sparsest cut in graphs of bounded treewidth
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
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
Minimum vertex cover in rectangle graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Towards certain fixes with editing rules and master data
Proceedings of the VLDB Endowment
Graph homomorphism revisited for graph matching
Proceedings of the VLDB Endowment
Robust sensor placements at informative and communication-efficient locations
ACM Transactions on Sensor Networks (TOSN)
Set connectivity problems in undirected graphs and the directed steiner network problem
ACM Transactions on Algorithms (TALG)
Minimal subsidies in expense sharing games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Theoretical Computer Science
Information Processing Letters
Proceedings of the fourth ACM international conference on Web search and data mining
Optimal decompositions of matrices with grades into binary and graded matrices
Annals of Mathematics and Artificial Intelligence
The complexity of equilibria in cost sharing games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
On minimizing average end-to-end delay in P2P live streaming systems
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
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
Approximating covering problems by randomized search heuristics using multi-objective models*
Evolutionary Computation
Orchestration by approximation: mapping stream programs onto multicore architectures
Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
Data integration with dependent sources
Proceedings of the 14th International Conference on Extending Database Technology
Improved Moves for Truncated Convex Models
The Journal of Machine Learning Research
More Robust Hashing: Cuckoo Hashing with a Stash
SIAM Journal on Computing
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on Computing
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Designing Network Protocols for Good Equilibria
SIAM Journal on Computing
An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
SIAM Journal on Computing
Approximation Algorithms for Multicommodity Facility Location Problems
SIAM Journal on Discrete Mathematics
SIAM Journal on Optimization
Buy-at-Bulk Network Design with Protection
Mathematics of Operations Research
The SCADS director: scaling a distributed storage system under stringent performance requirements
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
Information Processing Letters
Approximation algorithms for minimum chain vertex deletion
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Approximation algorithms for the Fault-Tolerant Facility Placement problem
Information Processing Letters
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Journal of Combinatorial Optimization
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
Property testing
Power management schemes for heterogeneous clusters under quality of service requirements
Proceedings of the 2011 ACM Symposium on Applied Computing
Property testing
Characterizing problems for realizing policies in self-adaptive and self-managing systems
Proceedings of the 6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems
Video distribution under multiple constraints
Theoretical Computer Science
A factor 2 approximation algorithm for the vertex cover P3 problem
Information Processing Letters
Social content matching in MapReduce
Proceedings of the VLDB Endowment
Incremental graph pattern matching
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Linear-work greedy parallel approximate set cover and variants
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Santa Claus schedules jobs on unrelated machines
Proceedings of the forty-third annual ACM symposium on Theory of computing
Platform synthesis and partitioning of real-time tasks for energy efficiency
Journal of Systems Architecture: the EUROMICRO Journal
Improving XML data quality with functional dependencies
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Improved approximations for hard optimization problems via problem instance classification
Rainbow of computer science
Online job-migration for reducing the electricity bill in the cloud
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
VMFlow: leveraging VM mobility to reduce network power costs in data centers
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
Approximability of the subset sum reconfiguration problem
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Quantum Information & Computation
A game theoretic approach for feature clustering and its application to feature selection
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part I
Set covering with ordered replacement: additive and multiplicative gaps
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
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
Privacy preservation for associative classification: an approximation algorithm
International Journal of Business Intelligence and Data Mining
A linear time approximation scheme for maximum quartet consistency on sparse sampled inputs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On the complexity of the l-diversity problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Optimal wafer cutting in shuttle layout problems
Journal of Combinatorial Optimization
GAPs: Geospatial Abduction Problems
ACM Transactions on Intelligent Systems and Technology (TIST)
A Tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem
INOC'11 Proceedings of the 5th international conference on Network optimization
Solving MAXSAT by solving a sequence of simpler SAT instances
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Efficiently speeding up sequential computation through the n-way programming model
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
Theoretical Computer Science
Online Optimization with Uncertain Information
ACM Transactions on Algorithms (TALG)
Celerity: a low-delay multi-party conferencing solution
MM '11 Proceedings of the 19th ACM international conference on Multimedia
On the complexity of isoperimetric problems on trees
Discrete Applied Mathematics
Approximation of Partial Capacitated Vertex Cover
SIAM Journal on Discrete Mathematics
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
SIAM Journal on Computing
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
SIAM Journal on Computing
Price of anarchy for polynomial wardrop games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Adaptive Scheduling on Power-Aware Managed Data-Centers Using Machine Learning
GRID '11 Proceedings of the 2011 IEEE/ACM 12th International Conference on Grid Computing
Practical approximation of optimal multivariate discretization
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Hardness of approximation results for the problem of finding the stopping distance in tanner graphs
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
The entropy rounding method in approximation algorithms
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
The node-weighted steiner problem in graphs of restricted node weights
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
A primal-dual algorithm for online non-uniform facility location
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Further reflections on a theory for basic algorithms
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Complexity and approximation of fixing numerical attributes in databases under integrity constraints
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
An alternative proof that exact inference problem in bayesian belief networks is NP-hard
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Nash equilibria, the price of anarchy and the fully mixed nash equilibrium conjecture
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
How well can primal-dual and local-ratio algorithms perform?
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A parallel distance-2 graph coloring algorithm for distributed memory computers
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Improvements for truthful mechanisms with verifiable one-parameter selfish agents
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
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Approximation schemes for packing with item fragmentation
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Derivation of a suitable finite test suite for customized probabilistic systems
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Approximating maximum diameter-bounded subgraphs
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
The complexity of counting eulerian tours in 4-regular graphs
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Generating cut conjunctions and bridge avoiding extensions in graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
From balls and bins to points and vertices
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On the L ∞ -norm of extreme points for crossing supermodular directed network LPs
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A primal-dual approximation algorithm for partial vertex cover: making educated guesses
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
Efficient approximation of convex recolorings
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 minimizing empirical error by axis-parallel hyperplanes
ECML'05 Proceedings of the 16th European conference on Machine Learning
The approximation scheme for peak power driven voltage partitioning
Proceedings of the International Conference on Computer-Aided Design
Randomized greedy: new variants of some classic approximation algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Welfare guarantees for combinatorial auctions with item bidding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Energy efficient broadcasting and multicasting in static wireless ad hoc networks
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
How to pack directed acyclic graphs into small blocks
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
A robust APTAS for the classical bin packing problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Design is as easy as optimization
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations 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
Approximation algorithms for the weighted independent set problem
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
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
Approximating the online set multicover problems via randomized winnowing
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Linear time algorithms for generalized edge dominating set problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Efficient algorithms for the longest path problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Automatic protocol signature generation framework for deep packet inspection
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
RIDA: robust intrusion detection in ad hoc networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Highly scalable algorithms for robust string barcoding
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Tα Παιδíα Παíζϵι the interaction between algorithms and game theory
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Rectangle covers revisited computationally
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Improved algorithm for degree bounded survivable network design problem
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
Multiagent task allocation in social networks
Autonomous Agents and Multi-Agent Systems
Novel scheduling algorithms for concurrent transmit/receive wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Multi-Criteria TSP: min and max combined
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
On approximation algorithms for data mining applications
Efficient Approximation and Online Algorithms
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
Theoretical Computer Science
Network design with edge-connectivity and degree constraints
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Approximating maximum cut with limited unbalance
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Approximation algorithms for multi-criteria traveling salesman problems
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
The 1-neighbour knapsack problem
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Differential approximation of MIN SAT, MAX SAT and related problems
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Regrouping service sites: a genetic approach using a voronoi diagram
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
The capacitated max-k-cut problem
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Matching based augmentations for approximating connectivity problems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Structured Learning and Prediction in Computer Vision
Foundations and Trends® in Computer Graphics and Vision
Minimum-Cost broadcast through varying-size neighborcast
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Recent thermal management techniques for microprocessors
ACM Computing Surveys (CSUR)
Online team formation in social networks
Proceedings of the 21st international conference on World Wide Web
Distributed graph pattern matching
Proceedings of the 21st international conference on World Wide Web
Semidefinite programming and approximation algorithms: a survey
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
The school bus problem on trees
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Approximate computation and implicit regularization for very large-scale data analysis
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
On the approximability of some degree-constrained subgraph problems
Discrete Applied Mathematics
On the approximability of Dodgson and Young elections
Artificial Intelligence
The feedback arc set problem with triangle inequality is a vertex cover problem
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Solving ramified optimal transport problem in the bayesian influence diagram framework
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Profile-guided deployment of stream programs on multicores
Proceedings of the 13th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, Tools and Theory for Embedded Systems
Bipartite graph structures for efficient balancing of heterogeneous loads
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Renewable and cooling aware workload management for sustainable data centers
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
GMPLS label space minimization through hypergraph layouts
Theoretical Computer Science
An efficient Monte-Carlo algorithm for pricing combinatorial prediction markets for tournaments
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
New complexity results for MAP in Bayesian networks
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
A system for providing differentiated QoS in retail banking
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
The maximum integer multiterminal flow problem in directed graphs
Operations Research Letters
A list heuristic for vertex cover
Operations Research Letters
A note on scenario reduction for two-stage stochastic programs
Operations Research Letters
Operations Research Letters
A polynomial case of the parsimony haplotyping problem
Operations Research Letters
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
Operations Research Letters
Survey: A survey on the structure of approximation classes
Computer Science Review
Computer Science Review
Selfish splittable flows and NP-completeness
Computer Science Review
Information-theoretic approaches to branching in search
Discrete Optimization
Scheduling jobs with time-resource tradeoff via nonlinear programming
Discrete Optimization
George Dantzig's impact on the theory of computation
Discrete Optimization
Minimum partition of an independence system into independent sets
Discrete Optimization
On approximation of the vertex cover problem in hypergraphs
Discrete Optimization
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
On the inapproximability of maximum intersection problems
Information Processing Letters
Routing equal-size messages on a slotted ring
Journal of Scheduling
Estimating entity importance via counting set covers
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Iterated Rounding Algorithms for the Smallest k-Edge Connected Spanning Subgraph
SIAM Journal on Computing
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs
SIAM Journal on Discrete Mathematics
The controller placement problem
Proceedings of the first workshop on Hot topics in software defined networks
Zero-one rounding of singular vectors
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Parameterized approximation via fidelity preserving transformations
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
The knapsack problem with neighbour constraints
Journal of Discrete Algorithms
Extended formulations, nonnegative factorizations, and randomized communication protocols
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Sparse WiFi deployment for vehicular internet access with bounded interconnection gap
IEEE/ACM Transactions on Networking (TON)
The controller placement problem
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Proceedings of the tenth ACM international conference on Embedded software
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings
Information and Computation
Min-cost multiflows in node-capacitated undirected networks
Journal of Combinatorial Optimization
Min-energy broadcast in mobile ad hoc networks with restricted motion
Journal of Combinatorial Optimization
On the set multicover problem in geometric settings
ACM Transactions on Algorithms (TALG)
Random Structures & Algorithms
Fast vertex guarding for polygons with and without holes
Computational Geometry: Theory and Applications
Computing while charging: building a distributed computing infrastructure using smartphones
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Algorithmic aspects of planning under uncertainty for service delivery organizations
ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
RETRAiN: a REcommendation tool for reconfiguration of retail bank branch
ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Communications of the ACM
Placing regenerators in optical networks to satisfy multiple sets of requests
IEEE/ACM Transactions on Networking (TON)
Wireless multicast scheduling with switched beamforming antennas
IEEE/ACM Transactions on Networking (TON)
ACM Computing Surveys (CSUR)
Greedy selfish network creation
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
The time complexity of A* with approximate heuristics on multiple-solution search spaces
Journal of Artificial Intelligence Research
Improved approximation for spanning star forest in dense graphs
Journal of Combinatorial Optimization
A linear time approximation scheme for computing geometric maximum k-star
Journal of Global Optimization
A Two-Stage Approach for Network Monitoring
Journal of Network and Systems Management
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Hardness of approximation and integer programming frameworks for searching for caterpillar trees
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Localization with sparse acoustic sensor network using UAVs as information-seeking data mules
ACM Transactions on Sensor Networks (TOSN)
A linear programming based method for joint object region matching and labeling
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part II
Improved bounds on the price of stability in network cost sharing games
Proceedings of the fourteenth ACM conference on Electronic commerce
Hardness of approximation and integer programming frameworks for searching for caterpillar trees
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Complexity of optimal lobbying in threshold aggregation
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
The power of deferral: maintaining a constant-competitive steiner tree online
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Incremental graph pattern matching
ACM Transactions on Database Systems (TODS)
Energy-efficient reliable data dissemination in duty-cycled wireless sensor networks
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Efficient implementation of a multi-dimensional index structure over flash memory storage systems
The Journal of Supercomputing
QoS-aware placement of stream processing service
The Journal of Supercomputing
One size does not fit all: multi-granularity search of web forums
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Using maximum coverage to optimize recommendation systems in e-commerce
Proceedings of the 7th ACM conference on Recommender systems
Cross-layer lifetime maximisation in wireless multihop networks with network coding
International Journal of Ad Hoc and Ubiquitous Computing
City-view image retrieval leveraging check-in data
Proceedings of the 2nd ACM international workshop on Geotagging and its applications in multimedia
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
A super-stabilizing log(n)-approximation algorithm for dynamic Steiner trees
Theoretical Computer Science
Approximating the reliable resource allocation problem using inverse dual fitting
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Online, deviation-constrained capacitated vehicle routing
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Simple FPTAS for the subset-sums ratio problem
Information Processing Letters
Computer Vision and Image Understanding
Domination analysis of algorithms for bipartite boolean quadratic programs
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
When almost is not even close: remarks on the approximability of HDTP
AGI'13 Proceedings of the 6th international conference on Artificial General Intelligence
A logarithmic approximation for unsplittable flow on line graphs
ACM Transactions on Algorithms (TALG)
Optimizing the "one big switch" abstraction in software-defined networks
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
Diversified top-k graph pattern matching
Proceedings of the VLDB Endowment
Multi-tuple deletion propagation: approximations and complexity
Proceedings of the VLDB Endowment
Active learning from relative queries
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Summarizing answer graphs induced by keyword queries
Proceedings of the VLDB Endowment
Socially desirable approximations for dodgson’s voting rule
ACM Transactions on Algorithms (TALG)
SCOOP: A Real-Time Sparsity Driven People Localization Algorithm
Journal of Mathematical Imaging and Vision
On the k-edge-incident subgraph problem and its variants
Discrete Applied Mathematics
The l-Diversity problem: Tractability and approximability
Theoretical Computer Science
Journal of Biomedical Informatics
Multi-pattern matching with bidirectional indexes
Journal of Discrete Algorithms
International Journal of Robotics Research
The minimum constraint removal problem with three robotics applications
International Journal of Robotics Research
A probabilistic PTAS for shortest common superstring
Theoretical Computer Science
Computing the differential of a graph: Hardness, approximability and exact algorithms
Discrete Applied Mathematics
Annals of Mathematics and Artificial Intelligence
Anytime approximation in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Distributed Lifetime and Data Rate Optimization with Dynamic Approximation in Wireless Networks
Wireless Personal Communications: An International Journal
Minimum diameter cost-constrained Steiner trees
Journal of Combinatorial Optimization
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
A Rough Set Approach to Information Systems Decomposition
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
| Hi-index | 0.17 |
This book will be of interest to the scientific community at large and, in particular, to students and researchers in Computer Science, Operation Research, and Discrete Mathematics. It can be used both as a text in a graduate course on approximation algorithms and as a supplementary text in basic undergraduate and graduate courses on algorithms.