Multiobjective query optimization
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the complexity of equilibria
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Combining convergence and diversity in evolutionary multiobjective optimization
Evolutionary Computation
Load Balancing in Distributed Systems: An Approach Using Cooperative Games
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Approximating Multi-objective Knapsack Problems
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
A PTAS for Distinguishing (Sub)string Selection
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Bicriteria Spanning Tree Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On preference-based search in state space graphs
Eighteenth national conference on Artificial intelligence
Quality of service in an information economy
ACM Transactions on Internet Technology (TOIT)
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems
Theoretical Computer Science
On the complexity of price equilibria
Journal of Computer and System Sciences - STOC 2002
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
Theoretical Computer Science
Typical properties of winners and losers in discrete optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Random knapsack in expected polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
Bicriteria approximation algorithms for scheduling problems with communications delays
Journal of Scheduling
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Information Processing Letters
Efficiently computing succinct trade-off curves
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Approximation algorithms for the bi-criteria weighted MAX-CUT problem
Discrete Applied Mathematics
Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
Theoretical Computer Science
Approximately dominating representatives
Theoretical Computer Science
Decision-making based on approximate and smoothed Pareto curves
Theoretical Computer Science
Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Efficient approximation of optimization queries under parametric aggregation constraints
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Succinct approximate convex pareto curves
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
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
Approximating Multi-criteria Max-TSP
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Semi-preemptive routing on trees
Discrete Applied Mathematics
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
Cardinality constrained and multicriteria (multi)cut problems
Journal of Discrete Algorithms
Reliability versus performance for critical applications
Journal of Parallel and Distributed Computing
On the Complexity of Obtaining Optimal Watermarking Schemes
IWDW '07 Proceedings of the 6th International Workshop on Digital Watermarking
Analyzing scheduling with transient failures
Information Processing Letters
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Near Admissible Algorithms for Multiobjective Search
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Multiplicative approximations and the hypervolume indicator
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Latency Constrained Aggregation in Chain Networks Admits a PTAS
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Evaluating design trade-offs in customizable processors
Proceedings of the 46th Annual Design Automation Conference
Multiobjective optimization using GAI models
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Information Processing Letters
International Journal of Applied Mathematics and Computer Science
Multi-objective model checking of Markov decision processes
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
The complexity of bottleneck labeled graph problems
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
A practical efficient fptas for the 0-1 multi-objective knapsack problem
ESA'07 Proceedings of the 15th annual European conference on Algorithms
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Markov decision processes with multiple long-run average objectives
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
On trade-offs in event delivery systems
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
The maximum hypervolume set yields near-optimal approximation
Proceedings of the 12th annual conference on Genetic and evolutionary computation
A survey on multi-constrained optimal path computation: Exact and approximate algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Utilitarian mechanism design for multi-objective optimization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
How good is the Chord algorithm?
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximability and hardness in multi-objective optimization
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Tight bounds for the approximation ratio of the hypervolume indicator
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Approximation algorithms for reliable stochastic combinatorial optimization
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximation schemes for multi-budgeted independence systems
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Pareto efficiency and approximate pareto efficiency in routing and load balancing games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem**
Evolutionary Computation
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
SIAM Journal on Computing
Timetable information: models and algorithms
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
The logarithmic hypervolume indicator
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Decision making with multiple objectives using GAI networks
Artificial Intelligence
Pareto optimal solutions for smoothed analysts
Proceedings of the forty-third annual ACM symposium on Theory of computing
An approximation algorithm for convex multi-objective programming problems
Journal of Global Optimization
Deterministic algorithms for multi-criteria TSP
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Supervised design space exploration by compositional approximation of Pareto sets
Proceedings of the 48th Design Automation Conference
Efficient approximation algorithms for multi-objective constraint optimization
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Exact algorithms for OWA-optimization in multiobjective spanning tree problems
Computers and Operations Research
Markov decision processes with multiple objectives
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
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
Journal of Parallel and Distributed Computing
Approximating min-max (regret) versions of some polynomial problems
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Decision making based on approximate and smoothed pareto curves
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximately dominating representatives
ICDT'05 Proceedings of the 10th international conference on Database Theory
Multi-budgeted matchings and matroid intersection via dependent rounding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for the bi-criteria weighted MAX-CUT problem
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Multicriteria global minimum cuts
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Profile-Based online data delivery
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
On approximating multicriteria TSP
ACM Transactions on Algorithms (TALG)
(Non)-approximability for the multi-criteria TSP(1, 2)
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Multi-Criteria TSP: min and max combined
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Approximation algorithms for multi-criteria traveling salesman problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Approximating the pareto front of multi-criteria optimization problems
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Recent advances in multiobjective optimization
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
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
Approximation with a fixed number of solutions of some biobjective maximization problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Approximation-guided evolutionary multi-objective optimization
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
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 note on scheduling to meet two min-sum objectives
Operations Research Letters
Complexity of the min-max (regret) versions of min cut problems
Discrete Optimization
On beam search for multicriteria combinatorial optimization problems
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Deterministic algorithms for multi-criteria Max-TSP
Discrete Applied Mathematics
Efficiency-revenue trade-offs in auctions
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
The new faces of combinatorial optimization
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Updating credal networks is approximable in polynomial time
International Journal of Approximate Reasoning
Min-Max quickest path problems
Networks
Interactive algorithm for multi-objective constraint optimization
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Pareto curves for probabilistic model checking
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Fair solutions for some multiagent optimization problems
Autonomous Agents and Multi-Agent Systems
Approximation quality of the hypervolume indicator
Artificial Intelligence
Anytime algorithms for biobjective heuristic search
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
A survey on offline scheduling with rejection
Journal of Scheduling
Approximating multi-objective scheduling problems
Computers and Operations Research
Single approximation for the biobjective Max TSP
Theoretical Computer Science
A study on the stability and efficiency of graphical games with unbounded treewidth
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Stochastic combinatorial optimization via poisson approximation
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A survey of pipelined workflow scheduling: Models and algorithms
ACM Computing Surveys (CSUR)
Approximation with a fixed number of solutions of some multiobjective maximization problems
Journal of Discrete Algorithms
Dominance rules for the choquet integral in multiobjective dynamic programming
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Optimal eviction policies for stochastic address traces
Theoretical Computer Science
| Hi-index | 0.01 |
We study problems in multiobjective optimization, in which solutions to a combinatorial optimization problem are evaluated with respect to several cost criteria, and we are interested in the trade-off between these objectives (the so-called Pareto curve). We point out that, under very general conditions, there is a polynomially succinct curve that /spl epsiv/-approximates the Pareto curve, for any /spl epsiv/