Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A deterministic algorithm for the cost-distance problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximating min-sum k-clustering in metric spaces
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups
Electronic Commerce Research
Approximation algorithms for time-dependent orienteering
Information Processing Letters
Approximation algorithms for clustering to minimize the sum of diameters
Nordic Journal of Computing
Approximation Algorithms for Clustering to Minimize the Sum of Diameters
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Budget Constrained Minimum Cost Connected Medians
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Approximation Algorithms for Time-Dependent Orienteering
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Bicriteria Spanning Tree Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Meet and merge: approximation algorithms for confluent flows
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
Multicast routing with multiple constraints in high-speed networks based on genetic algorithms
ICCC '02 Proceedings of the 15th international conference on Computer communication
The non-approximability of bicriteria network design problems
Journal of Discrete Algorithms
Trade-offs on the location of the core node in a network
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the approximability of some network design problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Meet and merge: Approximation algorithms for confluent flows
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Approximating the minimum number of maximum power users in ad hoc networks
Mobile Networks and Applications
Real time scheduling with a budget: parametric-search is better than binary search
Information Processing Letters
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A new model for path planning with interval data
Computers and Operations Research
Bicriteria approximation tradeoff for the node-cost budget problem
ACM Transactions on Algorithms (TALG)
Data aggregation in sensor networks: Balancing communication and delay costs
Theoretical Computer Science
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
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
Approximating Some Network Design Problems with Node Costs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Multicriteria network design using evolutionary algorithm
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Approximation algorithm for directed telephone multicast problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Data aggregation in sensor networks: balancing communication and delay costs
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
The minimum risk spanning tree problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Approximating some network design problems with node costs
Theoretical Computer Science
The density maximization problem in graphs
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Network-design with degree constraints
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Multiobjective network topology design
Applied Soft Computing
A bi-criteria approach for Steiner's tree problems in communication networks
Proceedings of the 2011 International Workshop on Modeling, Analysis, and Control of Complex Networks
Narrow-Shallow-Low-Light Trees with and without Steiner Points
SIAM Journal on Discrete Mathematics
On the existence of truthful mechanisms for the minimum-cost approximate shortest-paths tree problem
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Bicriteria network design via iterative rounding
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Multiobjective EA approach for improved quality of solutions for spanning tree problem
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
A bi-criteria algorithm for multipoint-to-multipoint virtual connections in transport networks
Proceedings of the 7th International Conference on Network and Services Management
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
Recent advances in multiobjective optimization
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Matching based augmentations for approximating connectivity problems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Improved approximations for buy-at-bulk and shallow-light k-steiner trees and (k,2)-subgraph
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm
Computer Communications
Approximating k-hop minimum-spanning trees
Operations Research Letters
Strongly polynomial-time approximation for a class of bicriteria problems
Operations Research Letters
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
Operations Research Letters
Approximation Techniques for Utilitarian Mechanism Design
SIAM Journal on Computing
On the minimum risk-sum path problem
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
On some network design problems with degree constraints
Journal of Computer and System Sciences
Minimum diameter cost-constrained Steiner trees
Journal of Combinatorial Optimization
The density maximization problem in graphs
Journal of Combinatorial Optimization
| Hi-index | 0.00 |