English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Near-Linear Time Approximations for Cut Problems via Fair Cuts

Li, J., Nanongkai, D., Panigrahi, D., & Saranurak, T. (2023). Near-Linear Time Approximations for Cut Problems via Fair Cuts. In N. Bansal, & V. Nagarajan (Eds.), Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 240-257). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977554.ch10.

Item is

Basic

show hide
Genre: Conference Paper

Files

show Files

Locators

show
hide
Description:
-
OA-Status:
Not specified

Creators

show
hide
 Creators:
Li, Jason1, Author
Nanongkai, Danupon2, Author                 
Panigrahi, Debmalya1, Author
Saranurak, Thatchaphol1, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2021-06-232023
 Publication Status: Published online
 Pages: 139 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: LiSODA23
DOI: 10.1137/1.9781611977554.ch10
 Degree: -

Event

show
hide
Title: Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: Florence, Italy
Start-/End Date: 2023-01-22 - 2023-01-25

Legal Case

show

Project information

show hide
Project name : DisDyn
Grant ID : 715672
Funding program : Horizon 2020 (H2020)
Funding organization : European Commission (EC)

Source 1

show
hide
Title: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2023
Source Genre: Proceedings
 Creator(s):
Bansal, Nikhil1, Editor
Nagarajan, Viswanath1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 240 - 257 Identifier: ISBN: 978-1-61197-755-4