2503 search results - page 369 / 501 » A study of 3-arc graphs |
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
ESA
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
A class of relational structures is said to have the extension preservation property if every first-order sentence that is preserved under extensions on the class is equivalent t...
ICDT
2005
ACM
14 years 3 months ago
2005
ACM
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
WADS
2005
Springer
14 years 3 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...