Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues
Abstract
References
Index Terms
- Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues
Recommendations
Improved approximation algorithms for minimum-weight vertex separators
STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computingWe develop the algorithmic theory of vertex separators, and its relation to the embeddings of certain metric spaces. Unlike in the edge case, we show that embeddings into L1 (and even Euclidean embeddings) are insufficient, but that the additional ...
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
We obtain improved algorithms for finding small vertex covers in bounded degree graphs and hypergraphs. We use semidefinite programming to relax the problems and introduce new} rounding techniques for these relaxations. On graphs with maximum degree at ...
Optimal Composition Ordering Problems for Piecewise Linear Functions
In this paper, we introduce maximum composition ordering problems. The input is n real functions $$f_1,\dots ,f_n:\mathbb {R}\rightarrow \mathbb {R}$$f1,ź,fn:RźR and a constant $$c\in \mathbb {R}$$cźR. We consider two settings: total and partial ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Transactions on Algorithms](/cms/asset/bfb7e669-7527-4622-aa65-bda15594bdf3/3266298.cover.jpg)
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed
Funding Sources
- JSPS KAKENHI
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 121Total Downloads
- Downloads (Last 12 months)21
- Downloads (Last 6 weeks)2
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format