A Facility Coloring Problem in 1-D

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-07956-1_9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Approximating the Max Edge-Coloring Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

A Hybrid Algorithm for the Robust Graph Coloring Problem

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

A Parallel McMc Algorithm for the Balanced Graph Coloring Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

On the Max-Weight Edge Coloring Problem

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2009English

Solution of the Heawood Map-Coloring Problem

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1968English

A Linked List-Based Exact Algorithm for Graph Coloring Problem

Revue d'Intelligence Artificielle
Artificial IntelligenceSoftware
2019English

Automatically Generated Algorithms for the Vertex Coloring Problem

PLoS ONE
Multidisciplinary
2013English

An Evolutionary Approach for Graph Multi-Coloring Problem

Applied Mathematical Sciences
2015English

Distributed (Δ +1)-Coloring in Sublogarithmic Rounds

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy