The network inhibition problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Routing with end-to-end QoS guarantees in broadband networks
IEEE/ACM Transactions on Networking (TON)
Approximating shallow-light trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Combined path and server selection in dynamic multimedia environments
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
An efficient algorithm for finding a path subject to two additive constraints
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A computational study of routing algorithms for realistic transportation networks
Journal of Experimental Algorithmics (JEA)
K-pair delay constrained minimum cost routing in undirected networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Optimal partition of QoS requirements on unicast paths and multicast trees
IEEE/ACM Transactions on Networking (TON)
An improved FPTAS for restricted shortest path
Information Processing Letters
The Quickest Multicommodity Flow Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Directory Based Composite Routing and Scheduling for Dynamic Multimedia Environments
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Algorithms for the Multi-constrained Routing Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
An FPTAS for Weight-Constrained Steiner Trees in Series-Parallel Graphs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Resource Constrained Shortest Paths
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
CD*: a real-time resolution optimal re-planner for globally constrained problems
Eighteenth national conference on Artificial intelligence
New polynomial-time instances to various knapsack-type problems
Fundamenta Informaticae
A PTAS for weight constrained Steiner trees in series-parallel graphs
Theoretical Computer Science
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
An efficient quality of service routing algorithm for delay-sensitive applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Algorithms for computing QoS paths with restoration
IEEE/ACM Transactions on Networking (TON)
Algorithms for precomputing constrained widest paths and multicast trees
IEEE/ACM Transactions on Networking (TON)
Approximation Algorithms for Multiconstrained Quality-of-Service Routing
IEEE Transactions on Computers
Efficiently computing succinct trade-off curves
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
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)
Replicated Server Placement with QoS Constraints
IEEE Transactions on Parallel and Distributed Systems
Distance- and curvature-constrained shortest paths and an application in mission planning
Proceedings of the 44th annual Southeast regional conference
Efficient QoS partition and routing of unicast and multicast
IEEE/ACM Transactions on Networking (TON)
Finding a path subject to many additive QoS constraints
IEEE/ACM Transactions on Networking (TON)
Multiconstrained QoS Routing: A Norm Approach
IEEE Transactions on Computers
Approximation schemes for a class of subset selection problems
Theoretical Computer Science
Path selection under multiple QoS constraints - a practical approach
Journal of High Speed Networks
Faster approximation schemes for fractional multicommodity flow problems
ACM Transactions on Algorithms (TALG)
Fast and efficient routing algorithms for delay-bounded and dependable channels
Computer Communications
Two techniques for fast computation of constrained shortest paths
IEEE/ACM Transactions on Networking (TON)
Polynomial time approximation algorithms for multi-constrained QoS routing
IEEE/ACM Transactions on Networking (TON)
Optimal combinatorial electricity markets
Web Intelligence and Agent Systems
Pervasive QoS routing in next generation networks
Computer Communications
Efficient Algorithms for k-Disjoint Paths Problems on DAGs
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
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
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
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
A new model for path planning with interval data
Computers and Operations Research
Improved approximating algorithms for Directed Steiner Forest
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Routing connections with differentiated reliability requirements in WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
A faster approximation scheme for timing driven minimum cost layer assignment
Proceedings of the 2009 international symposium on Physical design
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
Information Processing Letters
Real-Time Message Routing and Scheduling
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Finding a least hop(s) path subject to multiple additive constraints
Computer Communications
OPQR-G: algorithm for efficient QoS partition and routing in multiservice IP networks
Computer Communications
An efficient quality of service routing algorithm for delay-sensitive applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
A fully polynomial-time approximation scheme for timing-constrained minimum cost layer assignment
IEEE Transactions on Circuits and Systems II: Express Briefs
The epsilon-approximation to discrete VT assignment for leakage power minimization
Proceedings of the 2009 International Conference on Computer-Aided Design
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)
International Journal of Applied Mathematics and Computer Science
A novel routing protocol based on an energy model in ad hoc networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Real-time scheduling with a budget
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The minimum risk spanning tree problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
An ant colony optimization algorithm for the bi-objective shortest path problem
Applied Soft Computing
Journal of Computer and System Sciences
A survey on multi-constrained optimal path computation: Exact and approximate algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximation schemes for multi-budgeted independence systems
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Solving QoS routing problems by DCA
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Diameter-constrained steiner tree
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
INFORMS Journal on Computing
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Journal of Combinatorial Optimization
Complexity of most vital nodes for independent set in graphs related to tree structures
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Directed spanners via flow-based linear programs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Computers and Operations Research
QoS routing algorithms using fully polynomial time approximation scheme
Proceedings of the Nineteenth International Workshop on Quality of Service
Approximating some network design problems with node costs
Theoretical Computer Science
A note on approximating the min-max vertex disjoint paths on directed acyclic graphs
Journal of Computer and System Sciences
The most vital nodes with respect to independent set and vertex cover
Discrete Applied Mathematics
Reliable and restricted quickest path problems
INOC'11 Proceedings of the 5th international conference on Network optimization
Monitoring quality optimization in wireless sensor networks with a mobile sink
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Stability routing with constrained path length for improved routability in dynamic MANETs
Personal and Ubiquitous Computing
Robust combination of local controllers
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Routing with multiple quality-of-services constraints: An approximation perspective
Journal of Network and Computer Applications
Improved approximation algorithms for Directed Steiner Forest
Journal of Computer and System Sciences
Algorithms for delay constrained and energy efficiently routing in wireless sensor network
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the existence of truthful mechanisms for the minimum-cost approximate shortest-paths tree problem
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Supporting differentiated QoS in MPLS networks
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Designing a truthful mechanism for a spanning arborescence bicriteria problem
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
A comparison of exact and ε-approximation algorithms for constrained routing
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Unicast and multicast qos routing with multiple constraints
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Cost-Constrained minimum-delay multicasting
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Approximation algorithms and hardness results for labeled connectivity problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
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
Computing mobile agent routes with node-wise constraints in distributed communication systems
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
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
Algorithms and protocols for stateless constrained-based routing
Computer Communications
Operations Research Letters
Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows
Computer Communications
TAMCRA: a tunable accuracy multiple constraints routing algorithm
Computer Communications
An efficient algorithm for finding a path subject to two additive constraints
Computer Communications
Errata and comments on “Approximation algorithms for the capacitated plant allocation problem”
Operations Research Letters
A simple efficient approximation scheme for the restricted shortest path problem
Operations Research Letters
A better approximation algorithm for the budget prize collecting tree problem
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
A scalable algorithm for finding delay-constraint least-cost end-to-end path
ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part II
Computers and Operations Research
New polynomial-time instances to various knapsack-type problems
Fundamenta Informaticae
On the minimum risk-sum path problem
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
A Reference Point Approach for the Resource Constrained Shortest Path Problems
Transportation Science
A scalable method for DCLC problem using hierarchical MDP model
Computer Communications
Three-dimensional Route Planning for Unmanned Aerial Vehicles in a Risk Environment
Journal of Intelligent and Robotic Systems
A path-generation framework for real-time query processing in wireless sensor networks
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Best upgrade plans for large road networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
The subdivision-constrained routing requests problem
Journal of Combinatorial Optimization
Minimum diameter cost-constrained Steiner trees
Journal of Combinatorial Optimization
| Hi-index | 0.01 |