Bi-objective matchings with the triangle inequality
From MaRDI portal
Publication:515541
DOI10.1016/j.tcs.2017.01.012zbMath1358.05230OpenAlexW2579614863MaRDI QIDQ515541
Fanny Pascual, Laurent Gourvès, Daniel Vanderpooten, Jérôme Monnot
Publication date: 16 March 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.sorbonne-universite.fr/hal-01488424/file/bimatchfinal.pdf
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Cites Work
- Approximation with a fixed number of solutions of some multiobjective maximization problems
- New approaches to multi-objective optimization
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Deterministic algorithms for multi-criteria max-TSP
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time
- Single approximation for the biobjective Max TSP
- Approximate tradeoffs on weighted labeled matroids
- Two phase algorithms for the bi-objective assignment problem
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- A note on scheduling to meet two min-sum objectives
- On approximating multicriteria TSP
- Approximation Schemes for the Restricted Shortest Path Problem
- Many birds with one stone
- Multicriteria Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bi-objective matchings with the triangle inequality
