2 Search Results for "Potts, Chris N."

Document
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2016.47
Sampling in Potts Model on Sparse Random Graphs

Authors: Yitong Yin and Chihao Zhang

Published in: LIPIcs, Volume 60, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)

Abstract
We study the problem of sampling almost uniform proper q-colorings in sparse Erdos-Renyi random graphs G(n,d/n), a research initiated by Dyer, Flaxman, Frieze and Vigoda [Dyer et al., RANDOM STRUCT ALGOR, 2006]. We obtain a fully polynomial time almost uniform sampler (FPAUS) for the problem provided q>3d+4, improving the current best bound q>5.5d [Efthymiou, SODA, 2014]. Our sampling algorithm works for more generalized models and broader family of sparse graphs. It is an efficient sampler (in the same sense of FPAUS) for anti-ferromagnetic Potts model with activity 0<=b<1 on G(n,d/n) provided q>3(1-b)d+4. We further identify a family of sparse graphs to which all these results can be extended. This family of graphs is characterized by the notion of contraction function, which is a new measure of the average degree in graphs.
Cite as

Yitong Yin and Chihao Zhang. Sampling in Potts Model on Sparse Random Graphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 60, pp. 47:1-47:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{yin_et_al:LIPIcs.APPROX-RANDOM.2016.47,
  author =	{Yin, Yitong and Zhang, Chihao},
  title =	{{Sampling in Potts Model on Sparse Random Graphs}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
  pages =	{47:1--47:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-018-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{60},
  editor =	{Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.47},
  URN =		{urn:nbn:de:0030-drops-66706},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2016.47},
  annote =	{Keywords: Potts model, Sampling, Random Graph, Approximation Algorithm}
}
Document
DOI: 10.4230/OASIcs.ATMOS.2012.120
Train Scheduling and Rescheduling in the UK with a Modified Shifting Bottleneck Procedure

Authors: Banafsheh Khosravi, Julia A. Bennell, and Chris N. Potts

Published in: OASIcs, Volume 25, 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2012)

Abstract
This paper introduces a modified shifting bottleneck approach to solve train scheduling and rescheduling problems. The problem is formulated as a job shop scheduling model and a mixed integer linear programming model is also presented. The shifting bottleneck procedure is a well-established heuristic method for obtaining solutions to the job shop and other machine scheduling problems. We modify the classical shifting bottleneck approach to make it suitable for the types of job shop problem that arises in train scheduling. The method decomposes the problem into several single machine problems. Different variations of the method are considered with regard to solving the single machine problems. We compare and report the performance of the algorithms for a case study based on part of the UK railway network.
Cite as

Banafsheh Khosravi, Julia A. Bennell, and Chris N. Potts. Train Scheduling and Rescheduling in the UK with a Modified Shifting Bottleneck Procedure. In 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 25, pp. 120-131, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{khosravi_et_al:OASIcs.ATMOS.2012.120,
  author =	{Khosravi, Banafsheh and Bennell, Julia A. and Potts, Chris N.},
  title =	{{Train Scheduling and Rescheduling in the UK with a Modified Shifting Bottleneck Procedure}},
  booktitle =	{12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
  pages =	{120--131},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-45-3},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{25},
  editor =	{Delling, Daniel and Liberti, Leo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2012.120},
  URN =		{urn:nbn:de:0030-drops-37085},
  doi =		{10.4230/OASIcs.ATMOS.2012.120},
  annote =	{Keywords: Train Scheduling and Rescheduling, Job Shop Scheduling, Shifting Bottleneck Procedure}
}
  • Refine by Author
  • 1 Bennell, Julia A.
  • 1 Khosravi, Banafsheh
  • 1 Potts, Chris N.
  • 1 Yin, Yitong
  • 1 Zhang, Chihao

  • Refine by Classification

  • Refine by Keyword
  • 1 Approximation Algorithm
  • 1 Job Shop Scheduling
  • 1 Potts model
  • 1 Random Graph
  • 1 Sampling
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2012
  • 1 2016

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023 Schloss Dagstuhl - LZI GmbH Imprint Privacy Contact