Towards tight bounds for spectral sparsification of hypergraphs

Saved in:
Bibliographic Details
Published inProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
Format Conference Proceeding
LanguageEnglish
Online AccessGet full text
DOI10.1145/3406325.3451061

Cover

BookMark eNotjztPwzAYRT3AAIWZ1X8gxa-k9oRQxUuq1KXM1hc_GkvBtuxUVf49QWS69y5H99yjm5iiQ-iJki2lon3mgnSctVsuWko6eodeTukKxVY8hfMw4T5d4jJ8KrhmZ6YC41Kg1OCDgSmkiJPHw5xdORfIQ31Atx7G6h7X3KDv97fT_rM5HD--9q-HBlgnp0YY56UU0vbS9URyIw2A2jHLvBfLF8WM74iUSgCX3AJxinCwO4CeGaY43yDyz73EDPMVxlHnEn6gzJoS_eemVze9uvFf1H5J6Q
ContentType Conference Proceeding
DBID ADTOC
UNPAY
DOI 10.1145/3406325.3451061
DatabaseName Unpaywall for CDI: Periodical Content
Unpaywall
Database_xml – sequence: 1
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
ExternalDocumentID oai:infoscience.epfl.ch:295304
GroupedDBID ADTOC
UNPAY
ID FETCH-LOGICAL-a268t-4cef8848db8eb083c8caa972d2ff445192cf608894a383da0e903ad7aab2c2933
IEDL.DBID UNPAY
IngestDate Sun Oct 26 04:15:35 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License cc-by-nc-nd
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a268t-4cef8848db8eb083c8caa972d2ff445192cf608894a383da0e903ad7aab2c2933
OpenAccessLink https://proxy.k.utb.cz/login?url=http://infoscience.epfl.ch/record/295304
ParticipantIDs unpaywall_primary_10_1145_3406325_3451061
PublicationTitle Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
Score 2.3806655
SourceID unpaywall
SourceType Open Access Repository
Title Towards tight bounds for spectral sparsification of hypergraphs
URI http://infoscience.epfl.ch/record/295304
UnpaywallVersion submittedVersion
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA6yHcSLihMVlRy8eGht86vpSUQcQ3DssME8lbw0YWDpxtoi-tebdHUTPIi3HHII78H7vi-89z2EbihQmYARAU8AApYzE4DTbAEIYxIbcYgTP-_8MhajGXue8_nuv8NHtSv9rhzbItSL791oJOXUG3_2BXesu4f6s_Hk4bVz64kZv6MOmyjhIWXc65wDtN-UK_XxroriB2QMDzf-RVXrNOg7Rd7CpoZQf_72YfzzNUdosBvMw5Mt5ByjPVOeoPtp2_pa4doLbQx-UVKFHRnF7RjlWhXu4PSrbwpq84CXFi-c_ly3btXVAM2GT9PHUdDtRQgUEbIOmDZWSiZzkAYchdJSK5UmJCfWer-xlGgrfPsSU05_5ioyaURVnigFRDt4p6eoVy5Lc4YwZTomjjIZYSljUZ4m1gppSAqx0EDkObrdBjFbbfwvss0sM8-6gGddwC_-cfcS9ep1Y64coNdw3eXyC6jKpLI
linkProvider Unpaywall
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA6yHcSLihMVlRy8eGht86vpSUQcQ3DssME8lbw0YWDpxtoi-tebdHUTPIi3HHII78H7vi-89z2EbihQmYARAU8AApYzE4DTbAEIYxIbcYgTP-_8MhajGXue8_nuv8NHtSv9rhzbItSL791oJOXUG3_2BXesu4f6s_Hk4bVz64kZv6MOmyjhIWXc65wDtN-UK_XxroriB2QMDzf-RVXrNOg7Rd7CpoZQf_72YfzzNUdosBvMw5Mt5ByjPVOeoPtp2_pa4doLbQx-UVKFHRnF7RjlWhXu4PSrbwpq84CXFi-c_ly3btXVAM2GT9PHUdDtRQgUEbIOmDZWSiZzkAYchdJSK5UmJCfWer-xlGgrfPsSU05_5ioyaURVnigFRDt4p6eoVy5Lc4YwZTomjjIZYSljUZ4m1gppSAqx0EDkObrdBjFbbfwvss0sM8-6gGddwC_-cfcS9ep1Y64coNdw3eXyC6jKpLI
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+53rd+Annual+ACM+SIGACT+Symposium+on+Theory+of+Computing&rft.atitle=Towards+tight+bounds+for+spectral+sparsification+of+hypergraphs&rft_id=info:doi/10.1145%2F3406325.3451061&rft.externalDocID=oai%3Ainfoscience.epfl.ch%3A295304