Relaxation and Rounding

Ding-Zhu Du, Panos Pardalos, Xiaodong Hu and Weili Wu
Additional contact information
Ding-Zhu Du: University of Texas, Dallas
Panos Pardalos: University of Florida
Xiaodong Hu: Chinese Academy of Sciences
Weili Wu: University of Texas at Dallas

Chapter Chapter 11 in Introduction to Combinatorial Optimization, 2022, pp 323-348 from Springer

Abstract: Abstract The relaxation is a powerful technique to design approximation algorithms. It is similar to restriction, in terms of making a change on feasible domain; however, in an opposite direction, i.e., instead of shrinking the feasible domain, enlarge it by relaxing certain constraint. There are various issues about relaxation. In this chapter, we study some of them.

Date: 2022
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-031-10596-8_11

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

DOI: 10.1007/978-3-031-10596-8_11

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 ().