Sciweavers

2834 search results - page 208 / 567
» Representing Trees with Constraints
Sort
View
111
Voted
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 1 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
119
Voted
LATIN
2010
Springer
15 years 7 months ago
Sharp Separation and Applications to Exact and Parameterized Algorithms
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grando...
FMSP
2000
ACM
177views Formal Methods» more  FMSP 2000»
15 years 5 months ago
DSD: A schema language for XML
XML (eXtensible Markup Language) is a linear syntax for trees, which has gathered a remarkable amount of interest in industry. The acceptance of XML opens new venues for the appli...
Nils Klarlund, Anders Møller, Michael I. Sc...
89
Voted
FM
2009
Springer
124views Formal Methods» more  FM 2009»
15 years 7 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry
98
Voted
DBPL
1999
Springer
122views Database» more  DBPL 1999»
15 years 5 months ago
A Representation Independent Language for Planar Spatial Databases with Euclidean Distance
Linear constraint databases and query languages are appropriate for spatial database applications. Not only the data model is natural to represent a large portion of spatial data s...
Gabriel M. Kuper, Jianwen Su