scientific article; zbMATH DE number 7765379
From MaRDI portal
Publication:6065419
DOI10.4230/lipics.isaac.2020.21MaRDI QIDQ6065419
Unnamed Author, Yongho Shin, Hyung-Chan An
Publication date: 14 November 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
- The ellipsoid method and its consequences in combinatorial optimization
- Weakly bipartite graphs and the max-cut problem
- Packing odd paths
- Path parity and perfection
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Approximating minimum-cost connected \(T\)-joins
- Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections
- A 5-Approximation for Capacitated Facility Location
- LP-Based Algorithms for Capacitated Facility Location
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Facility Location in Dynamic Geometric Data Streams
- A new greedy approach for facility location problems
- Odd Minimum Cut-Sets and b-Matchings
- Analysis of a Local Search Heuristic for Facility Location Problems
- Matching, Euler tours and the Chinese postman
- Eight-Fifth Approximation for the Path TSP
- Approximation algorithms for a facility location problem with service capacities
- Facility Location in Evolving Metrics
- On Facility Location with General Lower Bounds
- Local-Search based Approximation Algorithms for Mobile Facility Location Problems: (Extended Abstract)
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
This page was built for publication: