Approximation Algorithm for the Kinetic Robust K-Center Problem

Computational Geometry: Theory and Applications- Netherlands

doi 10.1016/j.comgeo.2010.01.001

Full Text

Abstract

Available in

Date

Authors

Publisher

Elsevier BV

Related search

The Capacitated K-Center Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Worst Case Analysis of Approximation Algorithm of Abrams Et Al. For the Set K-Cover Problem

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2014English

A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

A Hybrid Algorithm for the Robust Graph Coloring Problem

Revista de Matemática: Teoría y Aplicaciones
2016English

A New Approximation Algorithm for the Multilevel Facility Location Problem

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2010English

A 2-Approximation Algorithm for the Online Tethered Coverage Problem

2019English

An Exact Algorithm for the Capacitated Vertex -Center Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2006English

A Near-Linear Algorithm for the Planar Segment-Center Problem

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1996English

An Exact Parallel Algorithm for the Radio K-Coloring Problem

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy