Rigid and globally rigid graphs with pinned vertices

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

We consider rigid and globally rigid bar-and-joint frameworks (resp. graphs) in which some joints (resp. vertices) are pinned down and hence their positions are fixed. We give an overview of some old and new results of this branch of combinatorial rigidity with an emphasis on the related optimization problems. In one of these problems the goal is to find a set P of vertices of minimum total cost for which the positions of all vertices become uniquely determined when P is pinned down. For this problem, which is motivated by the localization problem in wireless sensor networks, we give a constant factor approximation algorithm.

Original languageEnglish
Title of host publicationBolyai Society Mathematical Studies
Pages151-172
Number of pages22
Volume20
DOIs
Publication statusPublished - 2010
EventMeeting on Fete of Combinatorics and Computer Science - Keszthely, Hungary
Duration: Aug 11 2008Aug 15 2008

Other

OtherMeeting on Fete of Combinatorics and Computer Science
CountryHungary
CityKeszthely
Period8/11/088/15/08

Fingerprint

Approximation algorithms
Rigidity
Wireless sensor networks
Graph in graph theory
Costs
Wireless Sensor Networks
Approximation Algorithms
Branch
Optimization Problem

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this

Jordán, T. (2010). Rigid and globally rigid graphs with pinned vertices. In Bolyai Society Mathematical Studies (Vol. 20, pp. 151-172) https://doi.org/10.1007/978-3-642-13580-4_7

Rigid and globally rigid graphs with pinned vertices. / Jordán, T.

Bolyai Society Mathematical Studies. Vol. 20 2010. p. 151-172.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jordán, T 2010, Rigid and globally rigid graphs with pinned vertices. in Bolyai Society Mathematical Studies. vol. 20, pp. 151-172, Meeting on Fete of Combinatorics and Computer Science, Keszthely, Hungary, 8/11/08. https://doi.org/10.1007/978-3-642-13580-4_7
Jordán T. Rigid and globally rigid graphs with pinned vertices. In Bolyai Society Mathematical Studies. Vol. 20. 2010. p. 151-172 https://doi.org/10.1007/978-3-642-13580-4_7
Jordán, T. / Rigid and globally rigid graphs with pinned vertices. Bolyai Society Mathematical Studies. Vol. 20 2010. pp. 151-172
@inproceedings{7c9aa5e8923641c88a06cd595a27771f,
title = "Rigid and globally rigid graphs with pinned vertices",
abstract = "We consider rigid and globally rigid bar-and-joint frameworks (resp. graphs) in which some joints (resp. vertices) are pinned down and hence their positions are fixed. We give an overview of some old and new results of this branch of combinatorial rigidity with an emphasis on the related optimization problems. In one of these problems the goal is to find a set P of vertices of minimum total cost for which the positions of all vertices become uniquely determined when P is pinned down. For this problem, which is motivated by the localization problem in wireless sensor networks, we give a constant factor approximation algorithm.",
author = "T. Jord{\'a}n",
year = "2010",
doi = "10.1007/978-3-642-13580-4_7",
language = "English",
isbn = "9783642135798",
volume = "20",
pages = "151--172",
booktitle = "Bolyai Society Mathematical Studies",

}

TY - GEN

T1 - Rigid and globally rigid graphs with pinned vertices

AU - Jordán, T.

PY - 2010

Y1 - 2010

N2 - We consider rigid and globally rigid bar-and-joint frameworks (resp. graphs) in which some joints (resp. vertices) are pinned down and hence their positions are fixed. We give an overview of some old and new results of this branch of combinatorial rigidity with an emphasis on the related optimization problems. In one of these problems the goal is to find a set P of vertices of minimum total cost for which the positions of all vertices become uniquely determined when P is pinned down. For this problem, which is motivated by the localization problem in wireless sensor networks, we give a constant factor approximation algorithm.

AB - We consider rigid and globally rigid bar-and-joint frameworks (resp. graphs) in which some joints (resp. vertices) are pinned down and hence their positions are fixed. We give an overview of some old and new results of this branch of combinatorial rigidity with an emphasis on the related optimization problems. In one of these problems the goal is to find a set P of vertices of minimum total cost for which the positions of all vertices become uniquely determined when P is pinned down. For this problem, which is motivated by the localization problem in wireless sensor networks, we give a constant factor approximation algorithm.

UR - http://www.scopus.com/inward/record.url?scp=84880271989&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880271989&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-13580-4_7

DO - 10.1007/978-3-642-13580-4_7

M3 - Conference contribution

AN - SCOPUS:84880271989

SN - 9783642135798

VL - 20

SP - 151

EP - 172

BT - Bolyai Society Mathematical Studies

ER -