Approximating the independence number and the chromatic number in expected polynomial time
- Author
- KRIVELEVICH, Michael1 ; VU, Van H2
[1] Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel
[2] Department of Mathematics, University of California-San Diego, LaJolla, CA 92093, United States - Source
Journal of combinatorial optimization. 2002, Vol 6, Num 2, pp 143-155 ; ref : 22 ref
- ISSN
- 1382-6905
- Scientific domain
- Control theory, operational research; Mathematics
- Publisher
- Springer, Norwell, MA
- Publication country
- United States
- Document type
- Article
- Language
- English
- Keyword (fr)
- Algorithme glouton Analyse algorithme Approximation polynomiale Indépendance Matrice aléatoire Méthode polynomiale Nombre chromatique Temps polynomial Valeur propre
- Keyword (en)
- Greedy algorithm Algorithm analysis Polynomial approximation Independence Random matrix Polynomial method Chromatic number Polynomial time Eigenvalue
- Keyword (es)
- Algoritmo glotón Análisis algoritmo Aproximación polinomial Independencia Matriz aleatoria Método polinomial Número cromático Tiempo polinomial Valor propio
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A04 Flows in networks. Combinatorial problems
- Discipline
- Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 13485369
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Install on your browser
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:90:\"Approximating the independence number and the chromatic number in expected polynomial time\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Journal of combinatorial optimization\";s:9:\"\u0000*\u0000stitle\";s:14:\"J. comb. optim\";s:7:\"\u0000*\u0000date\";s:4:\"2002\";s:9:\"\u0000*\u0000volume\";s:1:\"6\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"143\";s:8:\"\u0000*\u0000epage\";s:3:\"155\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1382-6905\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"KRIVELEVICH\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Michael\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"VU, Van H\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:90:\"Approximating the independence number and the chromatic number in expected polynomial time\";s:8:\"\u0000*\u0000place\";s:11:\"Norwell, MA\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:90:\"Approximating the independence number and the chromatic number in expected polynomial time\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Journal of combinatorial optimization\";s:9:\"\u0000*\u0000stitle\";s:14:\"J. comb. optim\";s:7:\"\u0000*\u0000date\";s:4:\"2002\";s:9:\"\u0000*\u0000volume\";s:1:\"6\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"143\";s:8:\"\u0000*\u0000epage\";s:3:\"155\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1382-6905\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"KRIVELEVICH\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Michael\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"VU, Van H\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:90:\"Approximating the independence number and the chromatic number in expected polynomial time\";s:8:\"\u0000*\u0000place\";s:11:\"Norwell, MA\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:90:\"Approximating the independence number and the chromatic number in expected polynomial time\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Journal of combinatorial optimization\";s:9:\"\u0000*\u0000stitle\";s:14:\"J. comb. optim\";s:7:\"\u0000*\u0000date\";s:4:\"2002\";s:9:\"\u0000*\u0000volume\";s:1:\"6\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"143\";s:8:\"\u0000*\u0000epage\";s:3:\"155\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1382-6905\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"KRIVELEVICH\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Michael\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"VU, Van H\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:90:\"Approximating the independence number and the chromatic number in expected polynomial time\";s:8:\"\u0000*\u0000place\";s:11:\"Norwell, MA\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:90:\"Approximating the independence number and the chromatic number in expected polynomial time\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Journal of combinatorial optimization\";s:9:\"\u0000*\u0000stitle\";s:14:\"J. comb. optim\";s:7:\"\u0000*\u0000date\";s:4:\"2002\";s:9:\"\u0000*\u0000volume\";s:1:\"6\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"143\";s:8:\"\u0000*\u0000epage\";s:3:\"155\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1382-6905\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"KRIVELEVICH\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Michael\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"VU, Van H\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:90:\"Approximating the independence number and the chromatic number in expected polynomial time\";s:8:\"\u0000*\u0000place\";s:11:\"Norwell, MA\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:90:\"Approximating the independence number and the chromatic number in expected polynomial time\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Journal of combinatorial optimization\";s:9:\"\u0000*\u0000stitle\";s:14:\"J. comb. optim\";s:7:\"\u0000*\u0000date\";s:4:\"2002\";s:9:\"\u0000*\u0000volume\";s:1:\"6\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"143\";s:8:\"\u0000*\u0000epage\";s:3:\"155\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1382-6905\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"KRIVELEVICH\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Michael\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"VU, Van H\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:90:\"Approximating the independence number and the chromatic number in expected polynomial time\";s:8:\"\u0000*\u0000place\";s:11:\"Norwell, MA\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
