The maximum k-colorable subgraph problem for chordal graphs
Information Processing Letters
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
A generalization of chordal graphs and the maximum clique problem
Information Processing Letters
Tolerance intersection graphs on binary trees with constant tolerance
Discrete Mathematics
Improvements in throughout maximization for real-time scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
(Incremental) priority algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
SIAM Journal on Computing
A d/2 approximation for maximum weight independent set in d-claw free graphs
Nordic Journal of Computing
On approximating a vertex cover for planar graphs
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
On the complexity of fixed parameter clique and dominating set
Theoretical Computer Science
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
Mathematics of Operations Research
Optimization problems in multiple-interval graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating maximum weight K-colorable subgraphs in chordal graphs
Information Processing Letters
How well can primal-dual and local-ratio algorithms perform?
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Densest k-subgraph approximation on intersection graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
Approximation algorithms for secondary spectrum auctions
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
On sum coloring and sum multi-coloring for restricted families of graphs
Theoretical Computer Science
Secondary spectrum auctions for symmetric and submodular bidders
Proceedings of the 13th ACM Conference on Electronic Commerce
Wireless scheduling with power control
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, which is an ordering of the vertices such that, for each vertex v , the neighbors of v that occur later than v in the ordering form a clique. Akcoglu et al [1] define an extension of chordal graphs whereby the neighbors of v that occur later than v in the elimination order have at most k independent vertices. We refer to such graphs as sequentially k -independent graphs. We study properties of such families of graphs, and we show that several natural classes of graphs are sequentially k -independent for small k . In particular, any intersection graph of translates of a convex object in a two dimensional plane is a sequentially 3-independent graph; furthermore, any planar graph is a sequentially 3-independent graph. For any fixed constant k , we develop simple, polynomial time approximation algorithms for sequentially k -independent graphs with respect to several well-studied NP-complete problems.