Amortized efficiency of list update and paging rules
Communications of the ACM
An optimal online algorithm for metrical task systems
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An optimal synchronizer for the hypercube
SIAM Journal on Computing
Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An optimal on-line algorithm for K-servers on trees
SIAM Journal on Computing
Concurrent online tracking of mobile users
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Decomposing graphs into regions of small diameter
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On sparse spanners of weighted graphs
Discrete & Computational Geometry
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A Graph-Theoretic Game and its Application to the $k$-Server Problem
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
A polylog(n)-competitive algorithm for metrical task systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On-line generalized Steiner problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On the approximability of numerical taxonomy (fitting distances by tree metrics)
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Distributed paging for general networks
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A polynomial time approximation scheme for minimum routing cost spanning trees
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Divide-and-conquer approximation algorithms via spreading metrics
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Topology Aggregation for Directed Graph
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
New Sparseness Results on Graph Spanners
New Sparseness Results on Graph Spanners
An O(pn2) algorithm for the p -median and related problems on tree graphs
Operations Research Letters
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
ACM SIGACT News
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation algorithms for clustering problems
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Placement algorithms for hierarchical cooperative caching
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A constant factor approximation algorithm for a class of classification problems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Better algorithms for unfair metrical task systems and applications
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An approximation algorithm for the covering Steiner problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for the 0-extension problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for the metric labeling problem via a new linear programming formulation
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A data tracking scheme for general networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Approximating min-sum k-clustering in metric spaces
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A constant factor approximation for the single sink edge installation problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Competitive concurrent distributed queuing
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Bandwidth constrained placement in a WAN
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Similarity estimation techniques from rounding algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Girth and euclidean distortion
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A lower bound on the distortion of embedding planar metrics into Euclidean space
Proceedings of the eighteenth annual symposium on Computational geometry
An approximation algorithm for the group Steiner problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The freeze-tag problem: how to wake up a swarm of robots
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Derandomized dimensionality reduction with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A general decomposition theorem for the k-server problem
Information and Computation
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Approximation algorithms for the covering Steiner problem
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
A constant-factor approximation algorithm for the k-median problem
Journal of Computer and System Sciences - STOC 1999
An improved approximation algorithm for the 0-extension problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Embedding k-outerplanar graphs into ℓ1
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A Variant of the Arrow Distributed Directory with Low Average Complexity
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Tree-Approximations for the Weighted Cost-Distance Problem
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Non-approximability of Weighted Multiple Sequence Alignment
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
New results for online page replication
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Minimum Restricted Diameter Spanning Trees
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
A General Decomposition Theorem for the k-Server Problem
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Non-approximability of weighted multiple sequence alignment
Theoretical Computer Science - Computing and combinatorics
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On metric ramsey-type phenomena
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
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Cuts, Trees and -Embeddings of Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Low dimensional embeddings of ultrametrics
European Journal of Combinatorics
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized k-server algorithms for growth-rate bounded graphs
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
Minimum restricted diameter spanning trees
Discrete Applied Mathematics
Approximating metrics by tree metrics
ACM SIGACT News
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Framework and algorithms for trend analysis in massive temporal data sets
Proceedings of the thirteenth ACM international conference on Information and knowledge management
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
New results for online page replication
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
On-line generalized Steiner problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Journal of the ACM (JACM)
On non-uniform multicommodity buy-at-bulk network design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Universal approximations for TSP, Steiner tree, and set cover
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On distance scales, embeddings, and efficient relaxations of the cut cone
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of low-distortion embeddings between point sets
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On network design problems: fixed cost flows and the covering steiner problem
ACM Transactions on Algorithms (TALG)
Randomized k-server algorithms for growth-rate bounded graphs
Journal of Algorithms
Metric Embeddings with Relaxed Guarantees
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Improved embeddings of graph metrics into random trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved lower and upper bounds for universal TSP in planar metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Randomized online algorithms for minimum metric bipartite matching
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A tight upper bound on the probabilistic embedding of series-parallel graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On earthmover distance, metric labeling, and 0-extension
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Assign ranges in general ad-hoc networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Ramsey-type theorems for metric spaces with applications to online problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy
ACM Transactions on Algorithms (TALG)
Probabilistic embeddings of bounded genus graphs into planar graphs
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Reordering buffers for general metric spaces
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
t-Spanners for metric space searching
Data & Knowledge Engineering
Set connectivity problems in undirected graphs and the directed Steiner network problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
ACM Transactions on Algorithms (TALG)
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Randomized k-server on hierarchical binary trees
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Relaxation in text search using taxonomies
Proceedings of the VLDB Endowment
Semi-preemptive routing on trees
Discrete Applied Mathematics
A randomized algorithm for the on-line weighted bipartite matching problem
Journal of Scheduling
Hardness of Embedding Metric Spaces of Equal Size
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
Maximum Gradient Embeddings and Monotone Clustering
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
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Additive Spanners for Circle Graphs and Polygonal Graphs
Graph-Theoretic Concepts in Computer Science
An axiomatic approach for result diversification
Proceedings of the 18th international conference on World wide web
On the geometry of graphs with a forbidden minor
Proceedings of the forty-first annual ACM symposium on Theory of computing
Complexity of wavelength assignment in optical network optimization
IEEE/ACM Transactions on Networking (TON)
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
Distributed resource management and matching in sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Survey on Oblivious Routing Strategies
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Randomized algorithm for the k-server problem on decomposable spaces
Journal of Discrete Algorithms
Improved online algorithms for the sorting buffer problem on line metrics
ACM Transactions on Algorithms (TALG)
On the bias and performance of the edge-set encoding
IEEE Transactions on Evolutionary Computation
Online and offline algorithms for the sorting buffers problem on the line metric
Journal of Discrete Algorithms
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
A sketch-based distance oracle for web-scale graphs
Proceedings of the third ACM international conference on Web search and data mining
Improved online algorithms for the sorting buffer problem
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
An O(log2k)-competitive algorithm for metric bipartite matching
ESA'07 Proceedings of the 15th annual European conference on Algorithms
The online transportation problem: on the exponential boost of one extra server
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Collective additive tree spanners of homogeneously orderable graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
MAP estimation of semi-metric MRFs via hierarchical graph cuts
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Routing and scheduling for energy and delay minimization in the powerdown model
INFOCOM'10 Proceedings of the 29th conference on Information communications
Maintaining approximate minimum steiner tree and k-center for mobile agents in a sensor network
INFOCOM'10 Proceedings of the 29th conference on Information communications
An improved competitive algorithm for reordering buffer management
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Genus and the geometry of the cut graph
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Online network design with outliers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Budgeted red-blue median and its generalizations
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
A regularization approach to metrical task systems
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Set connectivity problems in undirected graphs and the directed steiner network problem
ACM Transactions on Algorithms (TALG)
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs
SIAM Journal on Discrete Mathematics
Buy-at-Bulk Network Design with Protection
Mathematics of Operations Research
Oblivious buy-at-bulk in planar graphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
Minimizing movement in mobile facility location problems
ACM Transactions on Algorithms (TALG)
The price of anarchy in cooperative network creation games
ACM SIGecom Exchanges
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk
Mathematics of Operations Research
Fast clustering using MapReduce
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Resilient and low stretch routing through embedding into tree metrics
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Optimal lower bounds for universal and differentially private steiner trees and TSPs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Center-based clustering under perturbation stability
Information Processing Letters
Modeling and analysis of composite network embeddings
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Strict Cost Sharing Schemes for Steiner Forest
SIAM Journal on Computing
A new template for solving p-median problems for trees in sub-quadratic time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximating fault-tolerant group-Steiner problems
Theoretical Computer Science
The polymatroid steiner problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Approximating buy-at-bulk and shallow-light k-Steiner trees
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
Approximation algorithms for the k-median problem
Efficient Approximation and Online Algorithms
Improved approximation for single-sink buy-at-bulk
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Using petal-decompositions to build a low stretch spanning tree
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the efficiency of routing in sensor networks
Journal of Parallel and Distributed Computing
Collective additive tree spanners for circle graphs and polygonal graphs
Discrete Applied Mathematics
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
ACM Transactions on Algorithms (TALG)
Computer Science Review
On the p-median polytope of Y-free graphs
Discrete Optimization
Approximating k-hop minimum-spanning trees
Operations Research Letters
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Minimizing Energies with Hierarchical Costs
International Journal of Computer Vision
A node-capacitated okamura-seymour theorem
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Optimal random matchings, tours, and spanning trees in hierarchically separated trees
Theoretical Computer Science
Pathwidth, trees, and random embeddings
Combinatorica
A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design
Journal of Combinatorial Optimization
| Hi-index | 0.00 |