Fast Balanced Partitioning is Hard, Even on Grids and Trees
dc.contributor.author
Feldmann, Andreas E.
dc.date.accessioned
2020-09-25T12:34:52Z
dc.date.available
2017-06-11T16:43:14Z
dc.date.available
2020-05-29T06:16:35Z
dc.date.available
2020-09-25T12:34:52Z
dc.date.issued
2011-11-29
dc.identifier.uri
http://hdl.handle.net/20.500.11850/99447
dc.language.iso
en
en_US
dc.publisher
Cornell University
en_US
dc.subject
Balanced partitioning
en_US
dc.subject
Bicriteria approximation
en_US
dc.subject
Inapproximability
en_US
dc.subject
Grid graphs
en_US
dc.subject
Trees
en_US
dc.title
Fast Balanced Partitioning is Hard, Even on Grids and Trees
en_US
dc.title.alternative
Fast Balanced Partitioning of Grid Graphs is Hard
en_US
dc.type
Working Paper
ethz.journal.title
arXiv
ethz.pages.start
1111.6745
en_US
ethz.size
12 p.
en_US
ethz.identifier.arxiv
1111.6745
ethz.publication.place
Ithaca, NY
en_US
ethz.publication.status
published
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::03340 - Widmayer, Peter / Widmayer, Peter
en_US
ethz.relation.isPreviousVersionOf
20.500.11850/58811
ethz.date.deposited
2017-06-11T16:43:49Z
ethz.source
ECIT
ethz.identifier.importid
imp5936530b0006695531
ethz.ecitpid
pub:155590
ethz.eth
yes
en_US
ethz.availability
Metadata only
en_US
ethz.rosetta.installDate
2017-07-12T17:42:49Z
ethz.rosetta.lastUpdated
2021-02-15T17:33:38Z
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=Fast%20Balanced%20Partitioning%20is%20Hard,%20Even%20on%20Grids%20and%20Trees&rft.jtitle=arXiv&rft.date=2011-11-29&rft.spage=1111.6745&rft.au=Feldmann,%20Andreas%20E.&rft.genre=preprint&
Files in this item
| Files | Size | Format | Open in viewer |
|---|---|---|---|
|
There are no files associated with this item. |
|||
Publication type
-
Working Paper [5325]