منابع مشابه
The Densest Hemisphere Problem
DD i j a n M73 1473 E D I T I O N O F 1 N O V 65 I S O B S O L E T E __________________U N C L A S S I F I E D _______________________ _ S E C U R I T Y C L A S S I F I C A T I O N O F T H I S P A G E (When Data Entered) SECURITY CLASSIFICATION OP THIS PAPE (When D a ta Entered) «
متن کاملThe Densest k-Subhypergraph Problem
The Densest k-Subgraph (DkS) problem, and its corresponding minimization problem Smallest p-Edge Subgraph (SpES), have come to play a central role in approximation algorithms. This is due both to their practical importance, and their usefulness as a tool for solving and establishing approximation bounds for other problems. These two problems are not well understood, and it is widely believed th...
متن کاملDensest Subgraphs THE DENSE K SUBGRAPH PROBLEM
Given a graph G = (V, E) and a parameter k, we consider the problem of finding a subset U ⊆ V of size k that maximizes the number of induced edges (DkS). We improve upon the previously best known approximation ratio for DkS, a ratio that has not seen any progress during the last decade. Specifically, we improve the approximation ratio from n to n. The improved ratio is obtained by studying a va...
متن کاملOn the densest k-subgraph problem
Given an n-vertex graph G and a parameter k, we are to nd a k-vertex subgraph with the maximum number of edges. This problem is N P-hard. We show that the problem remains N P-hard even when the maximum degree in G is three. When G contains a k-clique, we give an algorithm that for any > 0 nds a k-vertex subgraph with at least (1 ?) ? k 2 edges, in time n O((1+log n k)==). We study the applicabi...
متن کاملAlgorithms for the Densest Sub-Lattice Problem
We give algorithms for computing the densest k-dimensional sublattice of an arbitrary lattice, and related problems. This is an important problem in the algorithmic geometry of numbers that includes as special cases Rankin’s problem (which corresponds to the densest sublattice problem with respect to the Euclidean norm, and has applications to the design of lattice reduction algorithms), and th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1978
ISSN: 0304-3975
DOI: 10.1016/0304-3975(78)90006-3