Uriel Feige, Michael Seltser  Home/Search
Context Related
| wisdom.weizmann.ac.il/pub/...9716.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fermivista.math....weizmann.ac.il (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Given an n-vertex graph G and a parameter k, we are to find a k-vertex subgraph with the maximum number of edges. This problem is NP -hard. We show that the problem remains NP -hard even when the maximum degree in G is three. When G contains a k-clique, we give an algorithm that for any ffl ? 0 finds a k-vertex subgraph with at least (1 \Gamma ffl) \Gamma k 2 \Delta edges, in time n O((1+log n k )=ffl) . We study the applicability of semidefinite programming for approximating the... (Update)
Cited by: More
Utility-based Sensor Selection - Fang Bian David (Correct)
Active bibliography (related documents): More All
0.5: Asymptotic Experimental for the Held-Karp Traveling.. - Johnson, McGeoch.. (1996) (Correct)
0.3: The Lovasz Theta Function and a Semidefinite Programming.. - Kleinberg, Goemans (1995) (Correct)
0.3: Around the PCP Theorem - Arora (1997) (Correct)
Similar documents based on text: More All
0.3: Approximation of Dense-k-Subgraph - Han, Ye, al. (2000) (Correct)
0.2: Approximation Algorithms for Maximization Problems arising in .. - Feige, Langberg (2001) (Correct)
0.2: Knowledge Discovery Objects and Queries in Distributed.. - Ras, Zheng (Correct)
BibTeX entry: (Update)
U. Feige and M. Seltser, "On the densest k-subgraph problem," The Weizmann Institute, Rehovot, Tech. Rep., 1997. http://citeseer.ist.psu.edu/feige97densest.html More
@techreport{ feige97densest,
author = "U. Feige and M. Seltser",
title = "On the densest k-subgraph problems",
number = "CS97-16",
month = "1,",
year = "1997",
url = "citeseer.ist.psu.edu/feige97densest.html" }
Citations (may not include all citations):415 Improved approximation algorithms for maximum cut and satisf.. - Goemans, Williamson - 1995
258 Matrix Analysis (context) - Horn, Johnson - 1986
230 Interior point methods in semidefinite programming with appl.. - Alizadeh - 1995
168 An Approximate Max-Flow Min-Cut Theorem for Uniform Multicom.. (context) - Leighton, Rao - 1988
149 Polynomial Time Approximation Schemes for Dense Instances of.. - Arora, Karger et al. - 1995
148 Combinatorial Optimization: Networks and Matroids (context) - Lawler - 1976
112 Improved Approximation Algorithms for MAX k-CUT and MAX BISE.. - Frieze, Jerrum - 1995
48 Self-Concordant Functions and Polynomial Time Methods in Con.. (context) - Nesterov, Nemirovskii - 1990
36 Derandomizing Semidefinite Programming Based Approximation A.. (context) - Mahajan, Ramesh - 1995
34 The eigenvalues of random symmetric matrices (context) - Furedi, Koml'os - 1981
30 Approximating the Value of Two Prover Proof Systems, With Ap.. - Feige, Goemans - 1995
23 Approximating the independence number via the `-function (context) - Alon, Kahale
15 Geometric Algorithms and Combinatorial Optimization (context) - Grotchel, Lov'asz et al. - 1988
6 The Dense k-Subgraph Problem - Feige, Kortsarz et al. - 1993
6 Greedily finding a dense subgraph (context) - Asahiro, Iwama et al. - 1996
3 Randomized Graph Products, Chromatic Numbers, and the Lov'as.. - Feige - 1995
2 Private communication (context) - Goemans
1 Approximate GRAPH COLOURING by Semidefinite Programming (context) - Karger, Motwani et al. - 1994
1 Finding Dense Subgraphs (context) - Asahiro, Iwama - 1995
1 The ellipsoid method and its consequences in combinatorial o.. (context) - Grotchel, Lov'asz et al. - 1981
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.wisdom.weizmann.ac.il.html): More
Local Majority Voting, Small Coalitions and Controlling Monopolies .. - Peleg (1996) (Correct)
On Constructing 1-1 One-Way Functions - Goldreich, Levin, Nisan (1995) (Correct)
Infinite Cyclic Impartial Games - Fraenkel, Rahat (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC