On Multicriteria Online Problems
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Bicriteria Spanning Tree Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Using sparsification for parametric minimum spanning tree problems
Nordic Journal of Computing
Typical properties of winners and losers in discrete optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Experimental analysis of online algorithms for the bicriteria scheduling problem
Journal of Parallel and Distributed Computing
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Information Processing Letters
Approximating the k-multicut problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Competitive algorithms for the bicriteria k-server problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Approximate k-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
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
Bicriteria approximation tradeoff for the node-cost budget problem
ACM Transactions on Algorithms (TALG)
The subdivision-constrained minimum spanning tree problem
Theoretical Computer Science
On Lagrangian Relaxation and Subset Selection Problems
Approximation and Online Algorithms
Monotone Covering Problems with an Additional Covering Constraint
Mathematics of Operations Research
A Survey on Multiple Objective Minimum Spanning Tree Problems
Algorithmics of Large and Complex Networks
New Hardness Results for Diophantine Approximation
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Information Processing Letters
Experimental analysis of online algorithms for the bicriteria scheduling problem
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
The minimum risk spanning tree problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
On the bicriteria k-server problem
ACM Transactions on Algorithms (TALG)
Utilitarian mechanism design for multi-objective optimization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for NP-hard optimization problems
Algorithms and theory of computation handbook
Approximation schemes for multi-budgeted independence systems
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
SIAM Journal on Computing
ESA'11 Proceedings of the 19th European conference on Algorithms
On the weight-constrained minimum spanning tree problem
INOC'11 Proceedings of the 5th international conference on Network optimization
Bicriteria network design via iterative rounding
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Multi-budgeted matchings and matroid intersection via dependent rounding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On approximating multicriteria TSP
ACM Transactions on Algorithms (TALG)
Online team formation in social networks
Proceedings of the 21st international conference on World Wide Web
Single approximation for biobjective max TSP
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
A theory and algorithms for combinatorial reoptimization
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Operations Research Letters
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
Operations Research Letters
Fair solutions for some multiagent optimization problems
Autonomous Agents and Multi-Agent Systems
Reoptimization of the minimum total flow-time scheduling problem
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Single approximation for the biobjective Max TSP
Theoretical Computer Science
Stochastic combinatorial optimization via poisson approximation
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |