Back to Results
First PageMeta Content
Combinatorial optimization / NP-complete problems / Network theory / Dynamic programming / Equations / Systems engineering / Tree decomposition / Graph / Shortest path problem / Graph theory / Mathematics / Theoretical computer science


Optimal Cuts and Partitions in Tree Metrics in Polynomial Time Marek Karpinski∗ Andrzej Lingas†
Add to Reading List

Document Date: 2012-12-14 09:54:30

Open Document

File Size: 203,44 KB

Share Result on Facebook

Company

SIAM Journal / PWS Publishing Co. / /

Currency

pence / /

/

Facility

University of Bonn / Lund University / /

IndustryTerm

dynamic programming algorithm / linear-time algorithm / correct solution / polynomial time solutions / polynomial time algorithm / Approximation algorithms / /

Organization

Centre for Mathematical Sciences / Society for Industrial and Applied Mathematics / Department of Computer Science / University of Bonn / Lund University / /

Person

S. Vempala / Uri Feige / MAX-CUT / M. Karpinski / Ravi Kannan / C. Kenyon / R. Kannan / Christos Levcopoulos / D. Sledneu / W. Fernandez de la Vega / N. Alon / A. Lingas / /

/

PublishedMedium

SIAM Journal on Computing / Theory of Computing / /

Technology

Approximation algorithms / dynamic programming algorithm / linear-time algorithm / polynomial time algorithm / /

SocialTag