Approximation Algorithms for Intersection Graphs

We study three complexity parameters that, for each vertex v , are an upper bound for the number of cliques that are sufficient to cover a subset S ( v ) of its neighbors. We call a graph k-perfectly groupable if S ( v ) consists of all neighbors, k-simplicial if S ( v ) consists of the neighbors wi...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 68; no. 2; pp. 312 - 336
Main Authors:	Kammer, Frank, Tholey, Torsten
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.02.2014 Springer
Subjects:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Convex and discrete geometry Data Structures and Information Theory Exact sciences and technology Flows in networks. Combinatorial problems Geometry Information retrieval. Graph Mathematics Mathematics of Computing Operational research and scientific management Operational research. Management science Sciences and techniques of general use Theoretical computing Theory of Computation Parameterized approximation algorithms Graph algorithms NP-hard problems Intersection graphs Intersection Partition Tree(graph) Dominating set Similarity Graph clique Chordal graph Graph theory Approximation algorithm Polynomial time Upper bound NP hard problem Graph colouring Independent set Intersection graph Parameterized complexity
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	We study three complexity parameters that, for each vertex v , are an upper bound for the number of cliques that are sufficient to cover a subset S ( v ) of its neighbors. We call a graph k-perfectly groupable if S ( v ) consists of all neighbors, k-simplicial if S ( v ) consists of the neighbors with a higher number after assigning distinct numbers to all vertices, and k-perfectly orientable if S ( v ) consists of the endpoints of all outgoing edges from v for an orientation of all edges. These parameters measure in some sense how chordal-like a graph is—the last parameter was not previously considered in literature. The similarity to chordal graphs is used to construct simple polynomial-time approximation algorithms with constant approximation ratio for many NP-hard problems, when restricted to graphs for which at least one of the three complexity parameters is bounded by a constant. As applications we present approximation algorithms with constant approximation ratio for maximum weighted independent set, minimum (independent) dominating set, minimum vertex coloring, maximum weighted clique, and minimum clique partition for large classes of intersection graphs.
AbstractList	We study three complexity parameters that, for each vertex v , are an upper bound for the number of cliques that are sufficient to cover a subset S ( v ) of its neighbors. We call a graph k-perfectly groupable if S ( v ) consists of all neighbors, k-simplicial if S ( v ) consists of the neighbors with a higher number after assigning distinct numbers to all vertices, and k-perfectly orientable if S ( v ) consists of the endpoints of all outgoing edges from v for an orientation of all edges. These parameters measure in some sense how chordal-like a graph is—the last parameter was not previously considered in literature. The similarity to chordal graphs is used to construct simple polynomial-time approximation algorithms with constant approximation ratio for many NP-hard problems, when restricted to graphs for which at least one of the three complexity parameters is bounded by a constant. As applications we present approximation algorithms with constant approximation ratio for maximum weighted independent set, minimum (independent) dominating set, minimum vertex coloring, maximum weighted clique, and minimum clique partition for large classes of intersection graphs.
Author	Kammer, Frank Tholey, Torsten
Author_xml	– sequence: 1 givenname: Frank surname: Kammer fullname: Kammer, Frank organization: Institut für Informatik, Augsburg University – sequence: 2 givenname: Torsten surname: Tholey fullname: Tholey, Torsten email: tholey@informatik.uni-augsburg.de organization: Institut für Informatik, Augsburg University
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28568813$$DView record in Pascal Francis
BookMark	eNp9kLFOwzAQhi1UJNrCA7B1YTTc2YntjFUFpVIlFpgtx7XbVGkS2UGCt8dpYGHodMP936-7b0YmTds4Qu4RHhFAPkWALOcUkNFCSKR4RaaYcUYhz3BCpoBS0UygvCGzGI-QgrIQUwLLrgvtV3UyfdU2i2W9b0PVH05x4duw2DS9C9HZ824dTHeIt-Tamzq6u985Jx8vz--rV7p9W29Wyy21HFVPuTJqV-Yyk9YLA555U7JdaaSVIAuWCweWZ7lRCrnHQuaCeS7AG6lKlxg-Jw9jb2eiNbUPprFV1F1Ip4ZvzVQuBjbl5JizoY0xOK9t1Z-f6YOpao2gB0F6FKTT33oQpDGR-I_8K7_EsJGJKdvsXdDH9jM0ScQF6AfwhHmN
CitedBy_id	crossref_primary_10_1016_j_endm_2016_09_035 crossref_primary_10_1007_s40840_025_01876_8 crossref_primary_10_1007_s00453_025_01329_5 crossref_primary_10_1137_19M1275085 crossref_primary_10_1002_jgt_22067 crossref_primary_10_1016_j_endm_2017_07_020 crossref_primary_10_1016_j_ipl_2021_106159 crossref_primary_10_1016_j_disc_2016_09_023
Cites_doi	10.1093/acprof:oso/9780198566076.001.0001 10.1007/978-3-540-78773-0_64 10.1016/0304-3975(76)90059-1 10.1016/0022-0000(91)90023-X 10.1145/1721837.1721856 10.1007/978-3-642-02927-1_64 10.4086/toc.2007.v003a006 10.1002/net.3230250205 10.1016/j.endm.2004.06.012 10.1007/s00373-011-1026-1 10.1016/0020-0190(81)90111-3 10.1016/0196-6774(83)90012-3 10.1007/BF01864170 10.1145/1383369.1383380 10.1006/jagm.1997.0903 10.1137/S0097539793251219 10.1145/1989493.1989520 10.1016/S0196-6774(02)00294-8 10.1016/S0012-365X(99)00231-9 10.1016/0890-5401(90)90043-H 10.1007/BF01196133 10.1007/978-1-4757-3613-7_23 10.1007/978-3-642-15369-3_20 10.1137/S0097539702402676 10.1007/978-1-4612-0515-9 10.1016/j.ipl.2008.09.021 10.1137/0201013 10.1137/S0097539703437843 10.1137/0601001 10.1016/0012-365X(90)90358-O 10.1287/opre.34.2.250 10.1145/800116.803775
ContentType	Journal Article
Copyright	Springer Science+Business Media, LLC 2012 2015 INIST-CNRS
Copyright_xml	– notice: Springer Science+Business Media, LLC 2012 – notice: 2015 INIST-CNRS
DBID	AAYXX CITATION IQODW
DOI	10.1007/s00453-012-9671-1
DatabaseName	CrossRef Pascal-Francis
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Applied Sciences Mathematics
EISSN	1432-0541
EndPage	336
ExternalDocumentID	28568813 10_1007_s00453_012_9671_1
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDPE ABDZT ABECU ABFSI ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP E.L EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9O PF- PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UQL UTJUX UZXMN VC2 VFIZW VH1 VXZ W23 W48 WK8 YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ZY4 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION IQODW
ID	FETCH-LOGICAL-c318t-38a8db5747cf6a0f2fab2dba7c7079256e0c345a8813f197562f360fa78be7cf3
IEDL.DBID	RSV
ISICitedReferencesCount	21
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000330032200002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0178-4617
IngestDate	Wed Apr 02 07:37:54 EDT 2025 Tue Nov 18 22:13:00 EST 2025 Sat Nov 29 03:45:25 EST 2025 Fri Feb 21 02:40:21 EST 2025
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	2
Keywords	Parameterized approximation algorithms Graph algorithms NP-hard problems Intersection graphs Intersection Partition Tree(graph) Dominating set Similarity Graph clique Chordal graph Graph theory Approximation algorithm Polynomial time Upper bound NP hard problem Graph colouring Independent set Intersection graph Parameterized complexity
Language	English
License	http://www.springer.com/tdm CC BY 4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c318t-38a8db5747cf6a0f2fab2dba7c7079256e0c345a8813f197562f360fa78be7cf3
PageCount	25
ParticipantIDs	pascalfrancis_primary_28568813 crossref_citationtrail_10_1007_s00453_012_9671_1 crossref_primary_10_1007_s00453_012_9671_1 springer_journals_10_1007_s00453_012_9671_1
PublicationCentury	2000
PublicationDate	2014-02-01
PublicationDateYYYYMMDD	2014-02-01
PublicationDate_xml	– month: 02 year: 2014 text: 2014-02-01 day: 01
PublicationDecade	2010
PublicationPlace	Boston
PublicationPlace_xml	– name: Boston – name: Heidelberg
PublicationTitle	Algorithmica
PublicationTitleAbbrev	Algorithmica
PublicationYear	2014
Publisher	Springer US Springer
Publisher_xml	– name: Springer US – name: Springer
References	Papadimitriou, Yannakakis (CR36) 1991; 43 Bar-Yehuda, Halldórsson, Naor, Shachnai, Shapira (CR2) 2006; 36 Erlebach, Jansen, Seidel (CR11) 2005; 34 Bodlaender (CR3) 1996; 25 Frank (CR16) 1976 Rose, Tarjan (CR38) 1975 Jiang, Zhang (CR29) 2011 Courcelle (CR8) 1990; 85 Tardos (CR39) 1986; 34 Hurink, Nieberg (CR26) 2008; 109 Hunt, Marathe, Radhakrishnan, Ravi, Rosenkrantz, Stearns (CR25) 1998; 26 Dumitrescu, Pach (CR10) 2011; 27 CR32 CR30 Golumbic (CR20) 1980 Zuckerman (CR41) 2007; 3 Flum, Grohe (CR14) 2006 Feige (CR13) 1997; 17 Garey, Johnson, Stockmeyer (CR17) 1976; 1 Akcoglu, Aspnes, DasGupta, Kao, Kontoghiorghes, Rustem, Siokos (CR1) 2002 Erlebach, van Leeuwen (CR12) 2008 Fowler, Paterson, Tanimoto (CR15) 1981; 12 Marathe, Breu, Hunt, Ravi, Rosenkrantz (CR33) 1995; 25 Imai, Asano (CR27) 1983; 4 Gibson, Pirwani (CR19) 2010 Nieberg, Hurink, Kern (CR34) 2008; 4 Griggs, West (CR23) 1980; 1 Downey, Fellows (CR9) 1999 Golumbic (CR21) 1988; 4 CR22 Ye, Borodin (CR40) 2009 Jamison, Mulder (CR28) 2000; 215 Niedermeier (CR35) 2006 Hoefer, Kesselheim, Vöcking (CR24) 2011 Pirwani, Salavatipour (CR37) 2010 Gavril (CR18) 1972; 1 Butman, Hermelin, Lewenstein, Rawitz (CR4) 2010; 6 Cerioli, Faria, Ferreira, Protti (CR5) 2004; 18 Clark, Colbourn, Johnson (CR7) 1990; 86 Kammer, Tholey, Voepel (CR31) 2010 Chan (CR6) 2003; 46 R.G. Downey (9671_CR9) 1999 J.L. Hurink (9671_CR26) 2008; 109 I.A. Pirwani (9671_CR37) 2010 A. Dumitrescu (9671_CR10) 2011; 27 T. Erlebach (9671_CR12) 2008 H.B. Hunt III (9671_CR25) 1998; 26 D.J. Rose (9671_CR38) 1975 R. Bar-Yehuda (9671_CR2) 2006; 36 R. Niedermeier (9671_CR35) 2006 A. Frank (9671_CR16) 1976 M. Gibson (9671_CR19) 2010 M.C. Golumbic (9671_CR20) 1980 É. Tardos (9671_CR39) 1986; 34 T. Erlebach (9671_CR11) 2005; 34 J. Flum (9671_CR14) 2006 M.R. Garey (9671_CR17) 1976; 1 M.V. Marathe (9671_CR33) 1995; 25 9671_CR22 J.R. Griggs (9671_CR23) 1980; 1 F. Gavril (9671_CR18) 1972; 1 M. Hoefer (9671_CR24) 2011 T. Nieberg (9671_CR34) 2008; 4 C.H. Papadimitriou (9671_CR36) 1991; 43 T.M. Chan (9671_CR6) 2003; 46 R.E. Jamison (9671_CR28) 2000; 215 K. Akcoglu (9671_CR1) 2002 B. Courcelle (9671_CR8) 1990; 85 B.N. Clark (9671_CR7) 1990; 86 H. Imai (9671_CR27) 1983; 4 M. Jiang (9671_CR29) 2011 M.R. Cerioli (9671_CR5) 2004; 18 R.J. Fowler (9671_CR15) 1981; 12 F. Kammer (9671_CR31) 2010 D. Zuckerman (9671_CR41) 2007; 3 U. Feige (9671_CR13) 1997; 17 M.C. Golumbic (9671_CR21) 1988; 4 H.L. Bodlaender (9671_CR3) 1996; 25 Y. Ye (9671_CR40) 2009 A. Butman (9671_CR4) 2010; 6 9671_CR32 9671_CR30
References_xml	– ident: CR22 – year: 2006 ident: CR35 publication-title: Invitation to Fixed-Parameter Algorithms doi: 10.1093/acprof:oso/9780198566076.001.0001 – start-page: 747 year: 2008 end-page: 758 ident: CR12 article-title: Domination in geometric intersection graphs publication-title: Proc. 8th Latin American Theoretical Informatics Symposium (LATIN 2008) doi: 10.1007/978-3-540-78773-0_64 – year: 2006 ident: CR14 publication-title: Parameterized Complexity Theory – volume: 1 start-page: 237 year: 1976 end-page: 267 ident: CR17 article-title: Some simplified NP-complete graph problems publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(76)90059-1 – volume: 43 start-page: 425 year: 1991 end-page: 440 ident: CR36 article-title: Optimization, approximation, and complexity classes publication-title: J. Comput. Syst. Sci. doi: 10.1016/0022-0000(91)90023-X – volume: 6 year: 2010 ident: CR4 article-title: Optimization problems in multiple-interval graphs publication-title: ACM Trans. Algorithms doi: 10.1145/1721837.1721856 – start-page: 774 year: 2009 end-page: 785 ident: CR40 article-title: Elimination graphs publication-title: 36th International Colloquium on Automata, Languages and Programming (ICALP 2009) doi: 10.1007/978-3-642-02927-1_64 – volume: 3 start-page: 103 year: 2007 end-page: 128 ident: CR41 article-title: Linear degree extractors and the inapproximability of max clique and chromatic number publication-title: Theory Comput. doi: 10.4086/toc.2007.v003a006 – volume: 25 start-page: 59 year: 1995 end-page: 68 ident: CR33 article-title: Simple heuristics for unit disk graphs publication-title: Networks doi: 10.1002/net.3230250205 – volume: 18 start-page: 73 year: 2004 end-page: 79 ident: CR5 article-title: On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation publication-title: Electron. Notes Discrete Math. doi: 10.1016/j.endm.2004.06.012 – volume: 27 start-page: 399 year: 2011 end-page: 411 ident: CR10 article-title: Minimum clique partition in unit disk graphs publication-title: Graphs Comb. doi: 10.1007/s00373-011-1026-1 – volume: 12 start-page: 133 year: 1981 end-page: 137 ident: CR15 article-title: Optimal packing and covering in the plane are NP-complete publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(81)90111-3 – volume: 4 start-page: 310 year: 1983 end-page: 323 ident: CR27 article-title: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane publication-title: J. Algorithms doi: 10.1016/0196-6774(83)90012-3 – start-page: 188 year: 2010 end-page: 199 ident: CR37 article-title: A weakly robust PTAS for minimum clique partition in unit disk graphs publication-title: Proc. 12th Scandinavian Symposium and Workshops on Algorithms Theory (SWAT 2010) – start-page: 243 year: 2010 end-page: 254 ident: CR19 article-title: Algorithms for dominating set in disk graphs: breaking the log barrier publication-title: Proc. 18th Annual European Symposium on Algorithms (ESA 2010) – volume: 4 start-page: 307 year: 1988 end-page: 321 ident: CR21 article-title: Algorithmic aspects of intersection graphs and representation hypergraphs publication-title: Graphs Comb. doi: 10.1007/BF01864170 – ident: CR30 – year: 1980 ident: CR20 publication-title: Algorithmic Graph Theory and Perfect Graphs – volume: 4 year: 2008 ident: CR34 article-title: Approximation schemes for wireless networks publication-title: ACM Trans. Algorithms doi: 10.1145/1383369.1383380 – volume: 26 start-page: 238 year: 1998 end-page: 274 ident: CR25 article-title: NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs publication-title: J. Algorithms doi: 10.1006/jagm.1997.0903 – volume: 25 start-page: 1305 year: 1996 end-page: 1317 ident: CR3 article-title: A linear-time algorithm for finding tree-decompositions of small treewidth publication-title: SIAM J. Comput. doi: 10.1137/S0097539793251219 – start-page: 177 year: 2011 end-page: 186 ident: CR24 article-title: Approximation algorithms for secondary spectrum auctions publication-title: Proc. 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 11) doi: 10.1145/1989493.1989520 – volume: 46 start-page: 178 year: 2003 end-page: 189 ident: CR6 article-title: Polynomial-time approximation schemes for packing and piercing fat objects publication-title: J. Algorithms doi: 10.1016/S0196-6774(02)00294-8 – volume: 215 start-page: 115 year: 2000 end-page: 131 ident: CR28 article-title: Tolerance intersection graphs on binary trees with constant tolerance 3 publication-title: Discrete Math. doi: 10.1016/S0012-365X(99)00231-9 – volume: 85 start-page: 12 year: 1990 end-page: 75 ident: CR8 article-title: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs publication-title: Inf. Comput. doi: 10.1016/0890-5401(90)90043-H – volume: 17 start-page: 79 year: 1997 end-page: 90 ident: CR13 article-title: Randomized graph products, chromatic numbers, and the Lovász function publication-title: Combinatorica doi: 10.1007/BF01196133 – start-page: 455 year: 2002 end-page: 479 ident: CR1 article-title: Opportunity cost algorithms for combinatorial auctions publication-title: Computational Methods in Decision-Making, Economics and Finance doi: 10.1007/978-1-4757-3613-7_23 – start-page: 62 year: 2011 end-page: 73 ident: CR29 article-title: Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy publication-title: Proc. 17th International Computing & Combinatorics Conference (COCOON 2011) – start-page: 260 year: 2010 end-page: 273 ident: CR31 article-title: Approximation algorithms for intersection graphs publication-title: Proc. 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010) and 14th International Workshop on Randomization and Computation (RANDOM 2010) doi: 10.1007/978-3-642-15369-3_20 – volume: 34 start-page: 1302 year: 2005 end-page: 1323 ident: CR11 article-title: Polynomial-time approximation schemes for geometric intersection graphs publication-title: SIAM J. Comput. doi: 10.1137/S0097539702402676 – year: 1999 ident: CR9 publication-title: Parameterized Complexity doi: 10.1007/978-1-4612-0515-9 – start-page: 245 year: 1975 end-page: 254 ident: CR38 article-title: Algorithmic aspects of vertex elimination publication-title: Proc. 7th Annual ACM Symposium on Theory of Computing (STOC 1975) – volume: 109 start-page: 155 year: 2008 end-page: 160 ident: CR26 article-title: Approximating minimum independent dominating sets in wireless networks publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2008.09.021 – start-page: 211 year: 1976 end-page: 226 ident: CR16 article-title: Some polynomial algorithms for certain graphs and hypergraphs publication-title: Proc. 5th British Combinatorial Conference – volume: 1 start-page: 180 year: 1972 end-page: 187 ident: CR18 article-title: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph publication-title: SIAM J. Comput. doi: 10.1137/0201013 – ident: CR32 – volume: 36 start-page: 1 year: 2006 end-page: 15 ident: CR2 article-title: Scheduling split intervals publication-title: SIAM J. Comput. doi: 10.1137/S0097539703437843 – volume: 1 start-page: 1 year: 1980 end-page: 7 ident: CR23 article-title: Extremal values of the interval number of a graph publication-title: SIAM J. Algebr. Discrete Methods doi: 10.1137/0601001 – volume: 86 start-page: 165 year: 1990 end-page: 177 ident: CR7 article-title: Unit disk graphs publication-title: Discrete Math. doi: 10.1016/0012-365X(90)90358-O – volume: 34 start-page: 250 year: 1986 end-page: 256 ident: CR39 article-title: A strongly polynomial algorithm to solve combinatorial linear programs publication-title: Oper. Res. doi: 10.1287/opre.34.2.250 – volume: 43 start-page: 425 year: 1991 ident: 9671_CR36 publication-title: J. Comput. Syst. Sci. doi: 10.1016/0022-0000(91)90023-X – start-page: 774 volume-title: 36th International Colloquium on Automata, Languages and Programming (ICALP 2009) year: 2009 ident: 9671_CR40 doi: 10.1007/978-3-642-02927-1_64 – volume: 27 start-page: 399 year: 2011 ident: 9671_CR10 publication-title: Graphs Comb. doi: 10.1007/s00373-011-1026-1 – volume: 25 start-page: 1305 year: 1996 ident: 9671_CR3 publication-title: SIAM J. Comput. doi: 10.1137/S0097539793251219 – start-page: 211 volume-title: Proc. 5th British Combinatorial Conference year: 1976 ident: 9671_CR16 – start-page: 62 volume-title: Proc. 17th International Computing & Combinatorics Conference (COCOON 2011) year: 2011 ident: 9671_CR29 – volume: 34 start-page: 1302 year: 2005 ident: 9671_CR11 publication-title: SIAM J. Comput. doi: 10.1137/S0097539702402676 – ident: 9671_CR32 – volume: 86 start-page: 165 year: 1990 ident: 9671_CR7 publication-title: Discrete Math. doi: 10.1016/0012-365X(90)90358-O – volume-title: Parameterized Complexity year: 1999 ident: 9671_CR9 doi: 10.1007/978-1-4612-0515-9 – start-page: 455 volume-title: Computational Methods in Decision-Making, Economics and Finance year: 2002 ident: 9671_CR1 doi: 10.1007/978-1-4757-3613-7_23 – start-page: 260 volume-title: Proc. 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010) and 14th International Workshop on Randomization and Computation (RANDOM 2010) year: 2010 ident: 9671_CR31 doi: 10.1007/978-3-642-15369-3_20 – start-page: 188 volume-title: Proc. 12th Scandinavian Symposium and Workshops on Algorithms Theory (SWAT 2010) year: 2010 ident: 9671_CR37 – start-page: 747 volume-title: Proc. 8th Latin American Theoretical Informatics Symposium (LATIN 2008) year: 2008 ident: 9671_CR12 doi: 10.1007/978-3-540-78773-0_64 – volume: 1 start-page: 180 year: 1972 ident: 9671_CR18 publication-title: SIAM J. Comput. doi: 10.1137/0201013 – volume: 109 start-page: 155 year: 2008 ident: 9671_CR26 publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2008.09.021 – volume: 46 start-page: 178 year: 2003 ident: 9671_CR6 publication-title: J. Algorithms doi: 10.1016/S0196-6774(02)00294-8 – volume: 25 start-page: 59 year: 1995 ident: 9671_CR33 publication-title: Networks doi: 10.1002/net.3230250205 – ident: 9671_CR22 – volume: 4 year: 2008 ident: 9671_CR34 publication-title: ACM Trans. Algorithms doi: 10.1145/1383369.1383380 – volume: 1 start-page: 237 year: 1976 ident: 9671_CR17 publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(76)90059-1 – volume: 215 start-page: 115 year: 2000 ident: 9671_CR28 publication-title: Discrete Math. doi: 10.1016/S0012-365X(99)00231-9 – volume: 34 start-page: 250 year: 1986 ident: 9671_CR39 publication-title: Oper. Res. doi: 10.1287/opre.34.2.250 – volume: 4 start-page: 307 year: 1988 ident: 9671_CR21 publication-title: Graphs Comb. doi: 10.1007/BF01864170 – volume: 6 year: 2010 ident: 9671_CR4 publication-title: ACM Trans. Algorithms doi: 10.1145/1721837.1721856 – start-page: 245 volume-title: Proc. 7th Annual ACM Symposium on Theory of Computing (STOC 1975) year: 1975 ident: 9671_CR38 doi: 10.1145/800116.803775 – volume: 3 start-page: 103 year: 2007 ident: 9671_CR41 publication-title: Theory Comput. doi: 10.4086/toc.2007.v003a006 – volume: 17 start-page: 79 year: 1997 ident: 9671_CR13 publication-title: Combinatorica doi: 10.1007/BF01196133 – start-page: 243 volume-title: Proc. 18th Annual European Symposium on Algorithms (ESA 2010) year: 2010 ident: 9671_CR19 – volume-title: Invitation to Fixed-Parameter Algorithms year: 2006 ident: 9671_CR35 doi: 10.1093/acprof:oso/9780198566076.001.0001 – volume: 36 start-page: 1 year: 2006 ident: 9671_CR2 publication-title: SIAM J. Comput. doi: 10.1137/S0097539703437843 – volume: 12 start-page: 133 year: 1981 ident: 9671_CR15 publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(81)90111-3 – start-page: 177 volume-title: Proc. 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 11) year: 2011 ident: 9671_CR24 doi: 10.1145/1989493.1989520 – volume: 26 start-page: 238 year: 1998 ident: 9671_CR25 publication-title: J. Algorithms doi: 10.1006/jagm.1997.0903 – ident: 9671_CR30 – volume: 18 start-page: 73 year: 2004 ident: 9671_CR5 publication-title: Electron. Notes Discrete Math. doi: 10.1016/j.endm.2004.06.012 – volume: 85 start-page: 12 year: 1990 ident: 9671_CR8 publication-title: Inf. Comput. doi: 10.1016/0890-5401(90)90043-H – volume-title: Algorithmic Graph Theory and Perfect Graphs year: 1980 ident: 9671_CR20 – volume-title: Parameterized Complexity Theory year: 2006 ident: 9671_CR14 – volume: 4 start-page: 310 year: 1983 ident: 9671_CR27 publication-title: J. Algorithms doi: 10.1016/0196-6774(83)90012-3 – volume: 1 start-page: 1 year: 1980 ident: 9671_CR23 publication-title: SIAM J. Algebr. Discrete Methods doi: 10.1137/0601001
SSID	ssj0012796
Score	2.1666465
Snippet	We study three complexity parameters that, for each vertex v , are an upper bound for the number of cliques that are sufficient to cover a subset S ( v ) of...
SourceID	pascalfrancis crossref springer
SourceType	Index Database Enrichment Source Publisher
StartPage	312
SubjectTerms	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Convex and discrete geometry Data Structures and Information Theory Exact sciences and technology Flows in networks. Combinatorial problems Geometry Information retrieval. Graph Mathematics Mathematics of Computing Operational research and scientific management Operational research. Management science Sciences and techniques of general use Theoretical computing Theory of Computation
Title	Approximation Algorithms for Intersection Graphs
URI	https://link.springer.com/article/10.1007/s00453-012-9671-1
Volume	68
WOSCitedRecordID	wos000330032200002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: Springer Nature Link [Accès UNIL ; CHUV ; HEP Vaud ; Sites BCUL] customDbUrl: eissn: 1432-0541 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012796 issn: 0178-4617 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1ZSwMxEB6k-iCI9cR6kQeflMAe6Sb7WMTqgxTxKH1bknSjhbot3VX8-U6yBxQP0PdJCDPJzjc7xwdwhj5Hol8zlEmZUhYHisYmiiljKM6lVLGrqhze8sFAjEbxXdXHndfV7nVK0n2pm2Y3iz5s7U9A44j7FEOeVfR2wvI13D8Mm9RBwB0pl6Wdpwz9c53K_G6LJWe0MZc56sWUhBZfMqPO4fTb_zrqFmxW-JL0yguxDStptgPtmruBVE95F7yeHSb-MSk7F0lv-jxbTIqX15wgiiXuP2HuqrQycm1nWud78NS_ery8oRV7AtX4TgsaCinGqovhgjaR9ExgpArGSnJth-Ih0kk9HbKuFMIPjR9zBEImjDwjuVAprgn3oZXNsvQAiOAacZrRCC4VBjg-xmhco5FDbTyhI9kBr1ZjoqvR4pbhYpo0Q5GdRhLUSGI1kvgdOG-WzMu5Gr8Jny7ZplkRiG5kz9-Bi9oQSfUG85-3O_yT9BGsI0hiZaX2MbSKxVt6Amv6vZjki1N39z4BgMrSGQ
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1ZSwMxEB5EBQWxnliPug8-KYE90k32sYi1Yi2itfRtyaYbLdRt6a7iz3eSPaB4gL5PQphJdr7ZmfkG4Ax9jkC_pggVIiY0cCMSKD8glKI4EyIKTFXloMt6PT4cBvdFH3daVruXKUnzpa6a3TT60LU_Lgl85hAMeVYoOixNmP_wOKhSBy4zQ7n02HlC0T-XqczvtlhwRhszkaJeVD7Q4ktm1Dicdu1fR92CzQJfWq38QmzDUpzsQK2c3WAVT3kX7JYmE_8Y552LVmvyPJ2Ps5fX1EIUa5n_hKmp0kqsa81pne7BU_uqf9khxfQEIvGdZsTjgo-iJoYLUvnCVq4SkTuKBJOaFA-RTmxLjzYF546nnIAhEFKebyvBeBTjGm8flpNpEh-AxZlEnKYkgssIAxwHYzQm0cieVDaXvqiDXaoxlAW1uJ5wMQkrUmSjkRA1EmqNhE4dzqsls5xX4zfhxoJtqhUub_r6_HW4KA0RFm8w_Xm7wz9Jn8Jap3_XDbs3vdsjWEfARPOq7WNYzuZv8QmsyvdsnM4b5h5-AmOh1P0
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1ZSwMxEB5ERQSxnliPug8-KaF7pJvsY1GrYikFtfRtyaYbLdRtaVbx5zvZC4oHiO9JCJMM801m8n0AZxhzBMY1RagQMaGBG5FA-QGhFIczIaIg66ocdFmvx4fDoF_onOqy270sSeZ_GgxLU5I2ZyPVrD6-GSRi-oBcEvjMIZj-rFDTR2_S9YdBVUZwWSbQZSToCcVYXZY1v1tiITBtzIRGG6lc3OJLlTQLPp3av7e9BZsF7rTa-UXZhqU42YFaqelgFS6-C3bbkIx_jPMfjVZ78jydj9OXV20hurWy90OddW8l1o3hutZ78NS5fry8JYWqApHovynxuOCjqIVphFS-sJWrROSOIsGkIctDBBTb0qMtwbnjKSdgCJCU59tKMB7FOMfbh-VkmsQHYHEmEb8piaAzwsTHwdyNSTx8TyqbS1_UwS5NGsqCctwoX0zCiiw5s0iIFgmNRUKnDufVlFnOt_Hb4MbCOVUzXN7yzf7rcFEeSlj4pv55ucM_jT6Ftf5VJ-ze9e6PYB1xFM2buY9hOZ2_xSewKt_TsZ43siv5CbpT3eE
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Approximation+Algorithms+for+Intersection+Graphs&rft.jtitle=Algorithmica&rft.au=KAMMER%2C+Frank&rft.au=THOLEY%2C+Torsten&rft.date=2014-02-01&rft.pub=Springer&rft.issn=0178-4617&rft.volume=68&rft.issue=2&rft.spage=312&rft.epage=336&rft_id=info:doi/10.1007%2Fs00453-012-9671-1&rft.externalDBID=n%2Fa&rft.externalDocID=28568813
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon