446 search results - page 16 / 90 » A Combinatorial Theorem for Trees |
119
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in ...
106
click to vote
EOR
2007
15 years 1 months ago
2007
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
103
Voted
CPC
2004
15 years 1 months ago
2004
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
137
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
132
Voted
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...