Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Drawing Planar Graphs Read chapter Read first chapter

2020 | OriginalPaper | Chapter

On the Maximum Edge-Pair Embedding Bipartite Matching

Authors : Cam Ly Nguyen, Vorapong Suppakitpaisarn, Athasit Surarerks, Phanu Vajanopath

Published in: WALCOM: Algorithms and Computation

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Given a set of edge pairs in a bipartite graph, we want to find a bipartite matching that includes a maximum number of those edge pairs. While the problem has many applications to wireless localization, to the best of our knowledge, there is no theoretical work for the problem. In this work, unless \(P = NP\), we show that there is no constant approximation for the problem. Suppose that k denotes the maximum number of input edge pairs such that a particular node can be in. Inspired by experimental results, we consider the case that k is small. While there is a simple polynomial-time algorithm for the problem when k is one, we show that the problem is NP-hard when k is greater than one. We also devise an efficient O(k)-approximation algorithm for the problem.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Partitioning a Graph into Complementary Subgraphs
next chapter Packing Arc-Disjoint Cycles in Bipartite Tournaments
Literature
1.
Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci. 54(2), 317–331 (1997)MathSciNetCrossRef
2.
Biswas, P., Lian, T.C., Wang, T.C., Ye, Y.: Semidefinite programming based algorithms for sensor network localization. ACM Trans. Sens. Netw. (TOSN) 2(2), 188–220 (2006)CrossRef
3.
Charikar, M., Hajiaghayi, M., Karloff, H.: Improved approximation algorithms for label cover problems. ESA 2009, 23–34 (2009)MathSciNetMATH
4.
Fleischner, H.: X. 1 algorithms for Eulerian trails. In: Eulerian Graphs and Related Topics: Part 1. Annals of Discrete Mathematics, vol. 50, pp. 1–13 (1991)
5.
Fleischner, H., Sabidussi, G., Sarvanov, V.I.: Maximum independent sets in 3-and 4-regular Hamiltonian graphs. Discrete Math. 310(20), 2742–2749 (2010)MathSciNetCrossRef
6.
Fleury, M.: Deux problemes de geometrie de situation. Journal de mathematiques elementaires 2(2), 257–261 (1883)
7.
8.
Halldórsson, M.M., Radhakrishnan, J.: Greed is good: approximating independent sets in sparse and bounded-degree graphs. Algorithmica 18(1), 145–163 (1997)MathSciNetCrossRef
9.
Hopcroft, J.E., Karp, R.M.: An \(n^{5/2}\) algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225–231 (1973)MathSciNetCrossRef
10.
Hu, L., Evans, D.: Localization for mobile sensor networks. In: MobiCom 2004, pp. 45–57 (2004)
11.
Nguyen, C.L., Georgiou, O., Yonezawa, Y., Doi, Y.: The wireless localisation matching problem and a maximum likelihood based solution. In: ICC 2017, pp. 1–7 (2017)
12.
Nguyen, C.L., Georgiou, O., Yonezawa, Y., Doi, Y.: The wireless localization matching problem. IEEE Internet Things J. 4(5), 1312–1326 (2017)CrossRef
13.
Nguyen, L., Georgiou, O., Suppakitpaisarn, V.: Improved localization accuracy using machine learning and refining RSS measurements. In: GLOBECOM Workshops 2018 (2018)
14.
Skiena, S.: Coloring bipartite graphs, chap. 5.5.2. In: Skiena, S. (ed.) Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, p. 213. Addison-Wesley, Reading (1990)
15.
Suppakitpaisarn, V., Dai, W., Baffier, J.F.: Robust network flow against attackers with knowledge of routing method. In: HPSR 2015, pp. 40–47 (2015)
Metadata
Title
On the Maximum Edge-Pair Embedding Bipartite Matching
Authors
Cam Ly Nguyen
Vorapong Suppakitpaisarn
Athasit Surarerks
Phanu Vajanopath
Copyright Year
2020
Book
WALCOM: Algorithms and Computation

Print ISBN: 978-3-030-39880-4

Electronic ISBN: 978-3-030-39881-1

Copyright Year: 2020

DOI
https://doi.org/10.1007/978-3-030-39881-1_20

Premium Partner

    Image Credits