409 search results - page 7 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
SODA
1998
ACM
13 years 8 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
SODA
1998
ACM
13 years 8 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
COCOON
2005
Springer
14 years 29 days ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...