Friending

Shuyang Gu (), Hongwei Du (), My T. Thai () and Ding-Zhu Du ()
Additional contact information
Shuyang Gu: The University of Texas at Dallas
Hongwei Du: Harbin Institute of Technology Shenzhen Graduate School
My T. Thai: University of Florida
Ding-Zhu Du: The University of Texas at Dallas

A chapter in Nonlinear Combinatorial Optimization, 2019, pp 265-272 from Springer

Abstract: Abstract The friending is a popular and important operation in online social networks. In this article, we discuss various optimization problems about friending. They can be formulated into nonlinear combinatorial optimization problems.

Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-16194-1_12

Ordering information: This item can be ordered from
http://www.springer.com/9783030161941

DOI: 10.1007/978-3-030-16194-1_12

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().